Related papers: The Cyclic Sieving Phenomenon for non-crossing for…
The number of subgroups and the number of cyclic subgroups are natural combinatorial invariants of a finite group. We investigate how restrictions on these quantities, together with the number of distinct prime divisors of $|G|$, enforce…
We review the recent result of Sato, Sekimoto, Hondou, and Takagi (cond-mat/0008393) on the irreversibility inevitably observed in systems consisting of many non-interacting ``small'' pieces. We focus on quantum models, and supply an…
A bi-Cayley graph over the cyclic group $(\mathbb{Z}_n, +)$ is called a bicirculant graph. Let $\Gamma=BC(\mathbb{Z}_n; R,T,S)$ be a bicirculant graph with $R=-R\subseteq \mathbb{Z}_n\setminus \{0\}$ and $T={-}T\subseteq…
We study abelian-by-cyclic Moufang loops. We construct all split $3$-divisible abelian-by-cyclic Moufang loops from so-called Moufang permutations on abelian groups $(X,+)$, which are permutations that deviate from an automorphism of…
We prove a number of results, new and old, about the cycle type of a random permutation on S_n. Underlying our analysis is the idea that the number of cycles of size k is roughly Poisson distributed with parameter 1/k. In particular, we…
We define cyclic $U$-statistics as a variant of $U$-statistics based on variables $X_1,\dots,X_n$ that are assumed to be cyclically ordered. We also define alternating $U$-statistics where in the definition terms are summed with alternating…
We generalize the classical single-crossing property to single-crossing property on trees and obtain new ways to construct Condorcet domains which are sets of linear orders which possess the property that every profile composed from those…
We carry the argument used in the proof of the Theorem of Denjoy over to the quasiperiodically forced case. Thus we derive that if a system of quasiperiodically forced circle diffeomorphisms with bounded variation of the derivative has no…
Given a set of cycles C of a graph G, the tree graph of G defined by C is the graph T(G,C) whose vertices are the spanning trees of G and in which two trees R and S are adjacent if the union of R and S contains exactly one cycle and this…
We give an explicit combinatorial proof of a weighted version of strong log-concavity for the generating polynomial of increasing spanning forests of a finite simple graph equipped with a total ordering of the vertices. In contrast to…
In this paper, we study a general Syracuse problem. We give some necessary conditions concerning the existence of eventual non trivial cycles. Some properties based on linear logarithmic forms are established. New general conjectures are…
Begin continuous time random walks from every vertex of a graph and have particles coalesce when they collide. We use a duality relation with the voter model to prove the process is site recurrent on bounded degree graphs, and for…
We discuss a notion of shuffle for trees which extends the usual notion of a shuffle for two natural numbers. We give several equivalent descriptions, and prove some algebraic and combinatorial properties. In addition, we characterize…
We consider quantum walks on the cycle in the non-stationary case where the `coin' operation is allowed to change at each time step. We characterize, in algebraic terms, the set of possible state transfers and prove that, as opposed to the…
Instead of $k$-Dyck paths we consider the equivalent concept of $k$-non-crossing trees. This is our preferred approach relative to down-step statistics modulo $k$ (first studied by Heuberger, Selkirk, and Wagner by different methods). One…
Intransitivity is a property of connected, oriented graphs representing species interactions that may drive their coexistence even in the presence of competition, the standard example being the three species Rock-Paper-Scissors game. We…
Interacting particle systems can often be constructed from a graphical representation, by applying local maps at the times of associated Poisson processes. This leads to a natural coupling of systems started in different initial states. We…
In a recent paper by K.-H. Lee, K. Lee and M. Mills, a mutation of reflections in the universal Coxeter group is defined in association with a mutation of a quiver. A matrix representation of these reflections is determined by a linear…
In heap-based languages, knowing that a variable x points to an acyclic data structure is useful for analyzing termination: this information guarantees that the depth of the data structure to which x points is greater than the depth of the…
The occurrence and the distribution of patterns of trees associated to natural numbers are investigated. Bounds from above and below are proven for certain natural quantities.