Related papers: Rational generating series for affine permutation …
After fixing a canonical ordering (or labeling) of the elements of a finite poset, one can associate each linear extension of the poset with a permutation. Some recent papers consider specific families of posets and ask how many linear…
The simple permutations in two permutation classes --- the 321-avoiding permutations and the skew-merged permutations --- are enumerated using a uniform method. In both cases, these enumerations were known implicitly, by working backwards…
In any Coxeter group, the conjugates of elements in its Coxeter generating set are called reflections and the reflection length of an element is its length with respect to this expanded generating set. In this article we give a simple…
By affine arithmetic is meant the set of affine consequences of Peano arithmetic. This is a continuous theory which is studied in the framework of affine logic, a sublogic of continuous logic. Affine arithmetic is undecidable. Also, its…
Pattern avoidance classes of permutations that cannot be expressed as unions of proper subclasses can be described as the set of subpermutations of a single bijection. In the case that this bijection is a permutation of the natural numbers…
We prove that the irreducible affine Coxeter groups are first-order rigid and deduce from this that they are profinitely rigid in the absolute sense. We then show that the first-order theory of any irreducible affine Coxeter group does not…
The group of affine transformations with rational coefficients, $aff(Q)$, acts naturally on the real line, but also on the $p$-adic fields. The aim of this note is to show that all these actions are necessary and sufficient to represent…
A model for a finite group is a set of linear characters of subgroups that can be induced to obtain every irreducible character exactly once. A perfect model for a finite Coxeter group is a model in which the relevant subgroups are the…
It is observed that the conjugacy growth series of the infinite finitary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…
In this paper, the (infinite) direct product of fields is investigated. In particular, the finiteness of a given set is characterized in terms of some ring-theoretic observations. Next, a certain localization (whose multiplicative set…
A permutation representation of a Coxeter group $W$ naturally defines an absolute order. This family of partial orders (which includes the absolute order on $W$) is introduced and studied in this paper. Conditions under which the associated…
We study the structure of the category of representations of $\mathbf{FA}$, the category of finite sets and all maps, mostly working over a field of characteristic zero. This category is not semi-simple and exhibits interesting features. We…
Many interesting questions in arithmetic dynamics revolve, in one way or another, around the (local and/or global) reducibility behavior of iterates of a polynomial. We show that for very general families of integer polynomials $f$ (and,…
The aim is to give a geometric characterization of the finite generation of the Cox ring of anticanonical rational surfaces. This characterization is encoded in the finite generation of the effective monoid. Furthermore, we prove that in…
In this article, dedicated with admiration and gratitude to guru Neil Sloane on his 75-th birthday, we observe that the generating functions for multi-set permutations that do not contain an increasing subsequence of length d, and where…
Let $A_k$ be the set of permutations in the symmetric group $S_k$ with prefix 12. This paper concerns the enumeration of involutions which avoid the set of patterns $A_k$. We present a bijection between symmetric Schroder paths of length…
Given a rational function of degree at least two defined over a number field k, we study the cardinality of the set of rational iterated preimages. We prove bounds for the cardinality of this set as the rational function varies in certain…
We prove that the generating function for the number of flattened permutations having a given number of occurrences of the pattern 13-2 is rational, by using the recurrence relations and the kernel method.
We show that if $F(s)$ is a nondegenerate ordinary Dirichlet series with nonnegative coefficients and $F(k)$ is a rational number for all large enough positive integers $k$, then the denominators of those rational numbers are unbounded. In…
We study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth…