Related papers: Bijective counting of involutive Baxter permutatio…
We identify a subcategory of biracks which define counting invariants of unoriented links, which we call involutory biracks. In particular, involutory biracks of birack rank N=1 are biquandles, which we call bikei. We define counting…
The number of apparent double points of a smooth, irreducible projective variety $X$ of dimension $n$ in $\Proj^{2n+1}$ is the number of secant lines to $X$ passing through the general point of $\Proj^{2n+1}$. This classical notion dates…
In this paper we investigate some new problems in additive combinatorics. Our problems mainly involve permutations (or circular permutations) $n$ distinct numbers (or elements of an additive abelian group) $a_1,\ldots,a_n$ with adjacent…
We combinatorially characterize the number $\mathrm{cc}_2$ of conjugacy classes of involutions in any Coxeter group in terms of higher rank odd graphs. This notion naturally generalizes the concept of odd graphs, used previously to count…
Theorems relating permutations with objects in other fields of mathematics are often stated in terms of avoided patterns. Examples include various classes of Schubert varieties from algebraic geometry (Billey and Abe 2013), commuting…
In this paper we introduce and study a class of tableaux which we call permutation tableaux; these tableaux are naturally in bijection with permutations, and they are a distinguished subset of the Le-diagrams of Alex Postnikov. The…
We introduce a new approach to an enumerative problem closely linked with the geometry of branched coverings; that is, we study the number of ways a permutation can be decomposed into a product of a given number of 2-cycles, 3-cycles, etc.…
We study the existence of various sign and value patterns in sequences defined by multiplicative functions or related objects. For any set $A$ whose indicator function is 'approximately multiplicative' and uniformly distributed on short…
We give another bijective proof of a result of Corteel and Nadeau. We find a generating function related to unrestricted columns of permutation tableaux. As a consequence, we obtain a sign-imbalance formula for permutation tableaux. We…
P(n,s) denotes the number of permutations of 1,2,...n that have exactly s sequences. Canfield and Wilf [math.CO/0609704] recently showed that P(n,s) can be written as a sum of s polynomials in n. We determine these polynomials explicitly…
We obtain an alternate proof of an injectivity result by Beauville for a map from the moduli space of quartic del Pezzo surfaces to the set of conjugacy classes of certain subgroups of the Cremona group. This amounts to showing that a…
We study normal forms for families of area-preserving maps which have a fixed point with neutral multipliers -1 or +1 at epsilon=0. Our study covers both the orientation-preserving and orientation-reversing cases. In these cases Birkhoff…
An involution is usually defined as a mapping that is its own inverse. In this paper, we study quaternion involutions that have the additional properties of distribution over addition and multiplication. We review formal axioms for such…
New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…
We prove limit theorems for the number of fixed points, descents, and inversions of iterated random-to-top shuffles in two asymptotic regimes. Our proofs are analytic, and they utilize new combinatorial decompositions that represent each…
A new method to construct involutive non-degenerate set-theoretic solutions $(X^n,r^{(n)})$ of the Yang-Baxter equation from an initial solution $(X,r)$ is given. Furthermore, the permutation group $\mathcal{G}(X^n,r^{(n)})$ associated to…
Say that a permutation of $1,2,\ldots,n$ is \textit{$k$-bounded} if every pair of consecutive entries in the permutation differs by no more than $k$. Such a permutation is \textit{anchored} if the first entry is $1$ and the last entry is…
Let pi = pi_1 pi_2 ... pi_n be a permutation in the symmetric group S_n written in one-line notation. The pinnacle set of pi, denoted Pin pi, is the set of all pi_i such that pi_{i-1} < pi_i > pi_{i+1}. This is an analogue of the…
We look at geometric limits of large random non-uniform permutations. We mainly consider two theories for limits of permutations: permuton limits, introduced by Hoppen, Kohayakawa, Moreira, Rath, and Sampaio to define a notion of scaling…
A binary vector of length $N$ has elements that are either 0 or 1. We investigate the question of whether and how a binary vector of known length can be reconstructed from a limited set of its discrete Fourier transform (DFT) coefficients.…