Related papers: Decomposable shuffles
We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…
Simplicial arrangements are classical objects in discrete geometry. Their classification remains an open problem but there is a list conjectured to be complete at least for rank three. A further important class in the theory of hyperplane…
We develop a general approach to finding combinatorial models for cluster algebras. The approach is to construct a labeled graph called a framework. When a framework is constructed with certain properties, the result is a model…
Let A = (A,V) be a complex hyperplane arrangement and let L(A) denote its intersection lattice. The arrangement A is called supersolvable, provided its lattice L(A) is supersolvable, a notion due to Stanley. Jambu and Terao showed that…
Algorithms to generate various combinatorial structures find tremendous importance in computer science. In this paper, we begin by reviewing an algorithm proposed by Rohl that generates all unique permutations of a list of elements which…
We give a decomposition as a direct sum of indecomposable modules of several types of Specht modules in characteristic $2$. These include the Specht modules labelled by hooks, whose decomposability was considered by Murphy. Since the main…
The *somewhere-to-below shuffles* are the elements \[ t_{\ell} := \operatorname{cyc}_{\ell}+\operatorname{cyc}_{\ell,\ell+1}+\operatorname{cyc}_{\ell,\ell+1,\ell+2}+\cdots+\operatorname{cyc}_{\ell,\ell+1,\ldots,n} \] (for $\ell \in…
We identify a number of decidable and undecidable fragments of first-order concatenation theory. We also give a purely universal axiomatization which is complete for the fragments we identify. Furthermore, we prove some normal-form results.
Given a set I of word, the set of all words obtained by the shuffle of (copies of) words of I is naturally provided with a partial order. In [FS05], the authors have opened the problem of the characterization of the finite sets I such that…
In this paper, we formalize the sense in which higher homotopy groups are "infinitely commutative." In particular, we both simplify and extend the highly technical procedure, due to Eda and Kawamura, for constructing homotopies that…
We show how to use topological ideas, such as compactness, to establish orderability properties of infinite groups. A new application is to provide a left-ordering for the group of PL homeomorphisms of a connected surface with boundary…
We study the classical dynamics of spinning particles using scattering amplitudes and eikonal exponentiation. We show that observables are determined by a simple algorithm. A wealth of complexity arises in perturbation theory as positions,…
We present a new proof of a theorem of Schur's determining the least common multiple of the orders of all finite groups of complex $n \times n$-matrices whose elements have traces in the field of rational numbers. The basic method of proof…
We formulate a theory of shape valid for objects of arbitrary dimension whose contours are path connected. We apply this theory to the design and modeling of viable trajectories of complex dynamical systems. Infinite families of…
Following the general idea of Schur--Weyl scheme and using two suitable symmetric groups (instead of one), we try to make more explicit the classical problem of decomposing tensor representations of finite and infinite symmetric groups into…
A set A of natural numbers is finitely embeddable in another such set B if every finite subset of A has a rightward translate that is a subset of B. This notion of finite embeddability arose in combinatorial number theory, but in this paper…
We shall characterize the structure of invertible substitutions on three-letter alphabet. We show that any invertible substitution, after some cyclic operation, can be written as a finite product of permutations and Fibonacci's…
This article focuses on the study of the group of units of incidence rings, which is a class of infinite matrix groups indexed by ordered sets, on a topological perspective. We first show when these groups can inherit the topological…
We use Giraudo's construction of combinatorial operads from monoids to offer a conceptual explanation of the origins of Hoffbeck's path sequences of shuffle trees, and use it to define new monomial orders of shuffle trees. One such order is…
We provide an explicit description of the recurrent configurations of the sandpile model on a family of graphs $\widehat{G}_{\mu,\nu}$, which we call clique-independent graphs, indexed by two compositions $\mu$ and $\nu$. Moreover, we…