Related papers: NBB bases of some pattern avoiding lattices
We focus on a family of subsets $(\F^p_n)_{p\geq 2}$ of Dyck paths of semilength $n$ that avoid the patterns $DUU$ and $D^{p+1}$, which are enumerated by the generalized Fibonacci numbers. We endow them with the partial order relation…
Shallow permutations were defined in 1977 to be those that satisfy the lower bound of the Diaconis-Graham inequality. Recently, there has been renewed interest in these permutations. In particular, Berman and Tenner showed they satisfy…
We provide a simple injective proof that the number of 132-avoiding permutations with a unique longest increasing subsequence is at least as large as the number of 132-avoiding permutations without a unique longest increasing subsequence.
We show that the principal order ideal below an element w in the Bruhat order on involutions in a symmetric group is a Boolean lattice if and only if w avoids the patterns 4321, 45312 and 456123. Similar criteria for signed permutations are…
By studying lattices of normal subgroups, especially those of the socle and radical, an expression is obtained for the minimal number of conjugacy classes required to generate a group. This number is shown to be captured by the character…
In this paper we will give a M\"obius number of $NC^{k}(W) \setminus \bf{mins} \cup \{\hat{0} \}$ for a Coxeter group $W$ which contains an affirmative answer for the conjecture 3.7.9 in Armstrong's paper [ Generalized noncrossing…
We compute the nonabelian $\mathrm{SL_2}(\mathbb{C})$-character varieties of the rational knots $C(2n+1,2m,2)$ in the Conway notation, where $m$ and $n$ are non-zero integers. By studying real points on these varieties, we determine the…
Looking at some monoids and (semi)rings (natural numbers, integers and p-adic integers), and more generally, residually finite algebras (in a strong sense), we prove the equivalence of two ways for a function on such an algebra to behave…
We aim to analyse the abundance pattern of 169 Barium (Ba) stars, using machine learning techniques and the AGB final surface abundances predicted by Fruity and Monash stellar models. We developed machine learning algorithms that use the…
New developments in both the theories and experiments related to the extraction of the top-row Cabibbo-Kobayashi-Maskawa matrix elements $V_{ud}$ and $V_{us}$ led to a series of new anomalies, for instance the apparent violation of the…
Let I_n(\pi) denote the number of involutions in the symmetric group S_n which avoid the permutation \pi. We say that two permutations \alpha,\beta\in\S{j} may be exchanged if for every n, k, and ordering \tau of j+1,...,k, we have…
Given a collection of colored chain posets, we estimate the number of colored subsets of the boolean lattice which avoid all chains in the collection.
We present a bijection between 321- and 132-avoiding permutations that preserves the number of fixed points and the number of excedances. This gives a simple combinatorial proof of recent results of Robertson, Saracino and Zeilberger, and…
For every pattern $p$ over the alphabet $\{x,y,x^R,y^R\}$, we specify the least $k$ such that $p$ is $k$-avoidable.
We solve the classification problem for integrable lattices of the form $u_{,t}=f(u_{-2},\dots,u_2)$ under the additional assumption of invariance with respect to the group of linear-fractional transformations. The obtained list contains 5…
It is shown that Nambu-Poisson and Nambu-Jacobi brackets can be defined inductively: a n-bracket, n>2, is Nambu-Poisson (resp. Nambu-Jacobi) if and only if fixing an argument we get a (n-1)-Nambu-Poisson (resp. Nambu-Jacobi) bracket. As a…
A self-avoiding polygon is a lattice polygon consisting of a closed self-avoiding walk on a square lattice. Surprisingly little is known rigorously about the enumeration of self-avoiding polygons, although there are numerous conjectures…
An open conjecture in pattern avoidance theory is that the distribution of the major index among 321-avoiding permutations is distributed unimodally. We construct a formula for this distribution, and in the case of 2 descents prove…
We consider $d$-dimensional lattice polytopes $\Delta$ with $h^*$-polynomial $h^*_\Delta=1+h_k^*t^k$ for $1<k<(d+1)/2$ and relate them to some abelian subgroups of $\SL_{d+1}(\C)$ of order $1+h_k^*=p^r$ where $p$ is a prime number. These…
The number and the location of the monopoles observed on the lattice in QCD configurations happens to depend strongly on the choice of the gauge used to expose them, in contrast to the physical expectation that monopoles be gauge invariant…