Related papers: NBB bases of some pattern avoiding lattices
We enumerate 132-avoiding permutations of order 3 in terms of the Catalan and Motzkin generating functions, answering a question of B\'{o}na and Smith from 2019. We also enumerate 231-avoiding permutations that are composed only of…
Counting pattern avoiding ballot paths begins with a careful analysis of the pattern. Not the length, but the characteristics of the pattern are responsible for the difficulties in finding explicit solutions. Certain features, like overlap…
We investigated numerically properties of Nambu monopoles in lattice Electroweak theory at realistic values of $\alpha$ and $\theta_W$. Our choice of parameters of lattice Lagrangian corresponds to large values of the Higgs boson mass $M_H…
In the set of all patterns in $S_n$, it is clear that each k-pattern occurs equally often. If we instead restrict to the class of permutations avoiding a specific pattern, the situation quickly becomes more interesting. Mikl\'os B\'ona…
We show that one can skip the skew-symmetry assumption in the definition of Nambu-Poisson brackets. In other words, a n-ary bracket on the algebra of smooth functions which satisfies the Leibniz rule and a n-ary version of the Jacobi…
Two well-known polytopes whose vertices are indexed by permutations in the symmetric group $\mathfrak{S}_n$ are the permutohedron $P_n$ and the Birkhoff polytope $B_n$. We consider polytopes $P_n(\Pi)$ and $B_n(\Pi)$, whose vertices…
Patience Sorting is a combinatorial algorithm that can be viewed as an iterated, non-recursive form of the Schensted Insertion Algorithm. In recent work the authors have shown that Patience Sorting provides an algorithmic description for…
We perform a bottom-up search for discrete non-Abelian symmetries capable of quantizing the Cabibbo angle that parameterizes CKM mixing. Given a particular Abelian symmetry structure in the up and down sectors, we construct representations…
Gr\"obner bases of binomial ideals arising from finite lattices will be studied. In terms of Gr\"obner bases and initial ideals, a characterization of finite distributive lattices as well as planar distributive lattices will be given.
The study of pattern avoidance in permutations, and specifically in flattened partitions is an active area of current research. In this paper, we count the number of distinct flattened partitions over [n] avoiding a single pattern, as well…
A permutation $\pi$ contains a pattern $\sigma$ if and only if there is a subsequence in $\pi$ with its letters are in the same relative order as those in $\sigma$. Partially ordered patterns (POPs) provide a convenient way to denote…
X-ray photoelectron spectroscopy and diffraction (XPS, XPD) and scanning tunneling microscopy (STM) have been used for study of NbOx-structures on the Nb(110) surface. It is shown that niobium atoms are ordered to form a two-dimensional…
Babson and Steingr\'{\i}msson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We consider n-permutations that avoid the generalized pattern…
Bond-orientational order in DNA-assembled nanoparticle lattices is explored with the help of recently introduced Symmetry-specific Bond Order Parameters (SymBOPs). This approach provides a more sensitive analysis of local order than…
M\"obius transformations have been studied over the field of complex numbers. In this paper, we investigate M\"obius transformations over two rings which are not fields: the ring of double numbers and the ring of dual numbers. We give types…
We consider the enumeration of pattern-avoiding involutions, focusing in particular on sets defined by avoiding a single pattern of length 4. As we demonstrate, the numerical data for these problems demonstrates some surprising behavior.…
The notion of (3+1)-avoidance has shown up in many places in enumerative combinatorics. The natural goal of enumeration of all (3+1)-avoiding posets remains open. In this paper, we enumerate graded (3+1)-avoiding posets for both reasonable…
Orders in number fields provide natural examples of lattices. We ask: what can the successive minima of lattices arising from orders in number fields be? Given an order $\mathcal{O}$ of absolute discriminant $\Delta$ in a degree $n$ number…
A permutation $\pi$ is said to avoid a chain $(\sigma:\tau)$ of patterns if $\pi$ avoids $\sigma$ and $\pi^2$ avoids $\tau.$ In this paper, we define a notion of pattern avoidance for compositions of positive integers and use that idea to…
In this paper, we characterize and enumerate pattern-avoiding permutations composed of only 3-cycles. In particular, we answer the question for the six patterns of length 3. We find that the number of permutations composed of $n$ 3-cycles…