Related papers: NBB bases of some pattern avoiding lattices
We study arithmetical aspects of Ito-Sadahiro number systems with negative base. We show that the bases $-\beta<-1$, where $\beta$ is zero of $x^3-mx^2-mx-m,\ m\in\mathbb N,$ possess the so-called finiteness property. For the Tribonacci…
Motivated by M-theory, we define a new type of non-associative algebra involving usual and cubic matrices at the same time. The resulting algebra can be regarded as a two-term truncated $L_\infty$ algebra giving rise to a fundamental…
Experiences with the implementation of strong Gr\"obner bases respectively standard bases for polynomial rings over principal ideal rings are explained: different strategies for creating the pair set, methods to avoid coefficient growth and…
In this note, we prove some and conjecture other results regarding the distribution of descent top and descent bottom sets on some pattern-avoiding permutations. In particular, for 3-letter patterns, we show bijectively that the set of…
Baryon number is an accidental symmetry of the Standard Model (SM) Lagrangian that so far has been measured to be exactly preserved, although it is expected to be violated at higher energies. In this work we compute order-of-magnitude…
There are several well-known methods that one can use to construct Hadamard matrices from base sequences BS(m,n). In view of the recent classification of base sequences BS(n+1,n) for n <= 30, it may be of interest to show on an example how…
In this work it is shown that 20 canonical amino acids (AAs) within genetic code appear to be a whole system with strict AAs positions; more exactly, with AAs ordinal number in three variants; first variant 00-19, second 00-21 and third…
Transformation coefficients between standard bases for irreducible representations of the Brauer centralizer algebra $\mathfrak{B}_f(x)$ and split bases adapted to the $\mathfrak{B}_{f_1} (x) \times \mathfrak{B}_{f_2} (x) \subset…
We enumerate and characterize some classes of alternating and reverse alternating involutions avoiding a single pattern of length three or four. If on one hand the case of patterns of length three is trivial, on the other hand, the length…
We consider hyperplane arrangements generated by generic points and study their intersection lattices. These arrangements are known to be equivalent to discriminantal arrangements. We show a fundamental structure of the intersection…
In this paper, we study pattern avoidance for stabilized-interval-free (SIF) permutations. These permutations are contained in the set of indecomposable permutations and in the set of derangements. We enumerate pattern-avoiding SIF…
We have derived orbital basis sets from scattering theory. They are expressed as polynomial approximations to the energy dependence of a set of partial waves, in quantized form. The corresponding matrices, as well as the Hamiltonian and…
In this paper, we will study the M\"obius polynomial, an invariant of ranked posets that arises in the study of splitting algebras. We will present a formula for the M\"obius polynomial of the direct product of posets in terms of the…
Permutations that avoid given patterns are among the most classical objects in combinatorics and have strong connections to many fields of mathematics, computer science and biology. In this paper we study fixed points of both 123- and…
A method for finding an optimum $n$-dimensional commutative group code of a given order $M$ is presented. The approach explores the structure of lattices related to these codes and provides a significant reduction in the number of…
We have extended classical pattern avoidance to a new structure: multiple task-precedence posets whose Hasse diagrams have three levels, which we will call diamonds. The vertices of each diamond are assigned labels which are compatible with…
Let $B$ be a finite Boolean algebra. Let $\mathcal A$ be the partial order of all implication sublattices of $B$. We will compute the M\"obius function on $\mathcal A$ in two different ways.
Babson and Steingr\`imsson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. Subsequently, Claesson presented a complete solution for the…
If the list of binary numbers is read by upward-sloping diagonals, the resulting ``sloping binary numbers'' 0, 11, 110, 101, 100, 1111, 1010, ... (or 0, 3, 6, 5, 4, 15, 10, ...) have some surprising properties. We give formulae for the n-th…
The highest possible minimal norm of a unimodular lattice is determined in dimensions n <= 33. There are precisely five odd 32-dimensional lattices with the highest possible minimal norm (compared with more than 8*10^20 in dimension 33).…