Related papers: Rational generating series for affine permutation …

Let $A$ be an Artin group. A partition $\mathcal{P}$ of the set of standard generators of $A$ is called admissible if, for all $X,Y \in \mathcal{P}$, $X \neq Y$, there is at most one pair $(s,t) \in X \times Y$ which has a relation. An…

We completely classify the asymptotic behavior of the number of alternating sign matrices classically avoiding a single permutation pattern, in the sense of [Johansson and Linusson 2007]. In particular, we give a uniform proof of an…

In this note we prove the following results: $\bullet$ If a finitely presented group $G$ admits a strongly aperiodic SFT, then $G$ has decidable word problem. More generally, for f.g. groups that are not recursively presented, there exists…

In this short, elementary note we prove that if a faithful reflection representation of a Coxeter group preserves an orthant, then that Coxeter group is a product of symmetric groups acting on its natural permutation representation. We also…

Given a function $\psi$ in $ \LL^2(\R^d)$, the affine (wavelet) system generated by $\psi$, associated to an invertible matrix $a$ and a lattice $\zG$, is the collection of functions $\{|\det a|^{j/2} \psi(a^jx-\gamma): j \in \Z, \gamma \in…

We construct complex root spaces remaining invariant under antilinear involutions related to all Coxeter groups. We provide two alternative constructions: One is based on deformations of factors of the Coxeter element and the other based on…

In this paper, we enumerate two families of pattern-avoiding permutations: those avoiding the vincular pattern $2-41-3$, which we call semi-Baxter permutations, and those avoiding the vincular patterns $2-41-3$, $3-14-2$ and $3-41-2$, which…

The paper introduces a novel algorithm for computing the output admissible set of linear discrete-time systems subject to input saturation. The proposed method takes advantage of the piecewise-affine dynamics to propagate the output…

In this short note, we are interested in discussing characteristics of finite generating sets for $\mathcal{F}$, the set of all semiflows with non negative coefficients of a Petri Net. By systematically positioning these results over semi…

We define an Artin prime for an integer $g$ to be a prime such that $g$ is a primitive root modulo that prime. Let $g\in \mathbb{Z}\setminus\{-1\}$ and not be a perfect square. A conjecture of Artin states that the set of Artin primes for…

A geometric grid class consists of those permutations that can be drawn on a specified set of line segments of slope \pm1 arranged in a rectangular pattern governed by a matrix. Using a mixture of geometric and language theoretic methods,…

We establish recursions counting various classes of chains in the noncrossing partition lattice of a finite Coxeter group. The recursions specialize a general relation which is proven uniformly (i.e. without appealing to the classification…

We consider a model of stable edge sets (``matchings'') in a bipartite graph $G=(V,E)$ in which the preferences for vertices of one side (``firms'') are given via choice functions subject to standard axioms of consistency, substitutability…

Let $K$ be a field of characteristic 0, $f:\mathbb{N}\to K$ be a multiplicative function, and $F(z)=\sum_{n\geq 1} f(n)z^n\in K[[z]]$ be algebraic over $K(z)$. Then either there is a natural number $k$ and a periodic multiplicative function…

In this paper, we study a family of generating functions whose coefficients are polynomials that enumerate partitions in lower order ideals of Young's lattice. Our main result is that this family satisfies a rational recursion and are…

We have presented a multivariate polynomial function termed as factor elimination function,by which, we can generate prime numbers. This function's mapping behavior can explain the irregularities in the occurrence of prime numbers on the…

For affine symmetric groups we construct finite $W$-graphs corresponding to two-row shapes, and prove their uniqueness. This gives the first non-trivial family of examples of finite $W$-graphs in an affine type. We compare our construction…

In this paper, we give the first combinatorial proof of a rationality scheme for the generating series of maps in positive genus enumerated by both vertices and faces, which was first obtained by Bender, Canfield and Richmond in 1993 by…

We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the…

The fundamental bijection is a bijection $\theta:\mathcal{S}_n\to\mathcal{S}_n$ in which one uses the standard cycle form of one permutation to obtain another permutation in one-line form. In this paper, we enumerate the set of permutations…