-
Chapter and Conference Paper
A Method to Compute the Sparse Graphs for Traveling Salesman Problem Based on Frequency Quadrilaterals
In this paper, an iterative algorithm is designed to compute the sparse graphs for traveling salesman problem (TSP) according to the frequency quadrilaterals so that the computation time of the algorithms for TSP
-
Chapter and Conference Paper
Action Language Hybrid AL
This paper introduces an extension of the action language \(\mathcal {AL}\) to Hybrid
-
Article
Connection Coefficients Between Generalized Rising and Falling Factorial Bases
Let \({\mathcal{S} = (s_1, s_2, \ldots)}\) S ...
-
Book
-
Chapter
Symmetric Functions
The ring of symmetric functions is introduced. The six standard bases for symmetric functions; namely, the monomial, elementary, homogeneous, power, forgotten, and Schur symmetric functions, are defined. Numer...
-
Chapter
Counting with Nonstandard Bases
Generalizing the relationship between the elementary and power symmetric functions, we define a new basis for the ring of symmetric functions which has an expansion in terms of specially weighted brick tabloid...
-
Chapter and Conference Paper
Diagnosing Automatic Whitelisting for Dynamic Remarketing Ads Using Hybrid ASP
Hybrid ASP (H-ASP) is an extension of ASP that allows users to combine ASP type rules and numerical algorithms. Dynamic Remarketing Ads is Google’s platform for serving customized ads based on past interaction...
-
Chapter
Counting Problems That Involve Symmetry
Symmetric functions are used to prove Pólya’s enumeration theorem, allowing us to count objects modulo symmetries.
-
Chapter
The Reciprocity Method
In previous chapters, we defined ring homomorphisms φ \(\varphi\) ...
-
Chapter
Permutations, Partitions, and Power Series
Statistics on permutations and rearrangements are defined and relationships between q-analogues of n, n ...
-
Chapter
Counting with the Elementary and Homogeneous Symmetric Functions
The relationship between the elementary and homogeneous symmetric functions, specifically the expansion involving brick tabloids, is used to find an assortment of generating functions. We are able to count and...
-
Chapter
Counting with RSK
The RSK algorithm is introduced and used to find generating functions for permutation statistics. Connections are made to increasing subsequences in permutations and words and the Schur symmetric functions. A q-a...
-
Chapter
Consecutive Patterns
This chapter applies the machinery of ring homomorphisms on symmetric functions to understand consecutive pattern matches in permutations, words, cycles, and in alternating permutations.
-
Article
Row-Strict Quasisymmetric Schur Functions
Haglund, Luoto, Mason, and van Willigenburg introduced a basis for quasisymmetric functions, called the quasisymmetric Schur function basis, generated combinatorially through fillings of composition diagrams in m...
-
Article
Properties of the nonsymmetric Robinson–Schensted–Knuth algorithm
We introduce a generalization of the Robinson–Schensted–Knuth insertion algorithm for semi-standard augmented fillings whose basement is an arbitrary permutation σ∈S n ...
-
Article
Generating Functions for Permutations Avoiding a Consecutive Pattern
Given a permutation τ of length j, we say that a permutation σ has a τ-match starting at position i, if the elements in positions i, i+1, . . . , i+j−1 in σ have the same relative order as the elements of τ. We h...
-
Article
Open AccessSymmetric Functions and Generating Functions for Descents and Major Indices in Compositions
In [18], Mendes and Remmel showed how Gessel’s generating function for the distributions of the number of descents, the major index, and the number of inversions of permutations in the symmetric group could be...
-
Article
Classifying Descents According to Parity
In this paper we refine the well-known permutation statistic “descent” by fixing parity of (exactly) one of the descent’s numbers. We provide explicit formulas for the distribution of these (four) new statisti...
-
Chapter and Conference Paper
Feasibly Categorical Abelian Groups
In some recent work by Grigorieff [7], Remmel [14, 15], and Cenzer and Remmel [1, 2, 3, 4], a systematic study of polynomial time models and their relation to recursive models has been undertaken. Here we say ...
-
Article
The spread of a partial order
The deficiency of a partial order is the number of incomparable pairs. Another measure, the spread of a partial order is defined and its relation to the deficiency is established. In certain cases which arise ...