Related papers: Two Examples of Unbalanced Wilf-Equivalence
In this paper we establish Parseval type identities and surprising new inequalities for Hilbert-Schmidt frames. Our results generalize and improve the remarkable results which have been obtained by Balan et al. and G{\u{a}}vru{\c{t}}a.
The problem of linearization by point transformations is solved for equations in the generalized Riccati and Abel chain of order not exceeding the fourth. It is shown in particular that nonlinear third order and fourth order equations from…
When two patterns occur equally often in a set of permutations, we say that these patterns are equipopular. Using both structural and analytic tools, we classify the equipopular patterns in the set of separable permutations. In particular,…
We show that if $A$ and $B$ are finite sets of real numbers, then the number of triples $(a,b,c)\in A\times B\times (A\cup B)$ with $a+b=2c$ is at most $(0.15+o(1))(|A|+|B|)^2$ as $|A|+|B|\to\infty$. As a corollary, if $A$ is antisymmetric…
An elementary geometric proof for the existence of Witt's 5-(12,6,1) design is given.
We construct a family of examples of pairs of 4d N=2 SCFTs whose graded Coulomb branch dimensions, Weyl-anomaly coefficients and flavour symmetry algebras and levels coincide, but which are nonetheless distinct SCFTs. The difference…
In this paper, we enumerate Dumont permutations of the fourth kind avoiding or containing certain permutations of length 4. We also conjecture a Wilf-equivalence of two 4-letter patterns on Dumont permutations of the first kind.
In 2020, Bloom and Sagan defined subsets of the symmetric group $\mathfrak{S}_n$ called partial shuffles, and proved a formula for the Schur expansion of the pattern quasisymmetric function associated with a partial shuffle. In their proof,…
In this paper, new inequalities connected with the celebrated Steffensen's integral inequality are proved.
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…
A balanced pair in an ordered set $P=(V,\leq)$ is a pair $(x,y)$ of elements of $V$ such that the proportion of linear extensions of $P$ that put $x$ before $y$ is in the real interval $[1/3, 2/3]$. We define the notion of a good pair and…
Ascent sequences are sequences of nonnegative integers with restrictions on the size of each letter, depending on the number of ascents preceding it in the sequence. Ascent sequences have recently been related to (2+2)-free posets and…
We consider permutation classes having two basis elements of size three and one further basis element. We completely classify the possible enumeration sequences of such classes and demonstrate that there are far fewer of them than might be…
Classification models are expected to perform equally well for different classes, yet in practice, there are often large gaps in their performance. This issue of class bias is widely studied in cases of datasets with sample imbalance, but…
We show that all balanced d-lattices must be complemented, answering a question of Chajda and Eigenthaler. (A bounded lattice is balanced if any two congruences agree on their 1-classes iff they agree on their 0-classes.) Our main tool is…
We prove the existence of pairs of models of the same cardinality lambda which are very equivalent according to EF games, but not isomorphic. We continue the paper math.LO/0404222, but we don't rely on it.
We indicate a way of distinguishing between structures, for which, we call two structures distinguishable. Roughly, being distinguishable means that they differ in the number of realizations each gives for some formula. Being…
We study Bell scenarios with binary outcomes supplemented by one bit of classical communication. We develop a method to find facet inequalities for such scenarios even when direct facet enumeration is not possible, or at least difficult.…
We study combinatorial inequalities for various classes of set systems: matroids, polymatroids, poset antimatroids, and interval greedoids. We prove log-concavity inequalities for counting certain weighted feasible words, which generalize…
The poset of permutations of [n] under Bruhat ordering is studied. We give nontrivial upper and lower bounds for the number of comparable pairs of permutations in both the weak and strong versions of this order. In light of numerical…