Related papers: On super-strong Wilf equivalence classes of permut…
Kitaev, Potapov, and Vajnovszki [On shortening u-cycles and u-words for permutations, Discrete Appl. Math, 2019] described how to shorten universal words for permutations, to length $n!+n-1-i(n-1)$ for any $i \in [(n-2)!]$, by introducing…
We introduce and study a notion of duality for two classes of optimization problems commonly occurring in probability theory. That is, on an abstract measurable space $(\Omega,\mathcal{F})$, we consider pairs $(E,\mathcal{G})$ where $E$ is…
Starting with an inclusion-exclusion proof of a combinatorial identity, a direct bijection can be produced using recursive subtraction (sometimes with a direct combinatorial description). We apply this method to identities for generalized…
Permutations can be viewed as pairs of linear orders, or more formally as models over a signature consisting of two binary relation symbols. This approach was adopted by Albert, Bouvel and F\'eray, who studied the expressibility of…
A Smirnov word is a word over the positive integers in which adjacent letters must be different. A symmetric function enumerating these words by descent number arose in the work of Shareshian and the second named author on $q$-Eulerian…
Recently the second author introduced combinatorial principles that characterize supercompactness for inaccessible cardinals but can also hold true for small cardinals. We prove that the proper forcing axiom PFA implies these principles…
We introduce a new type of equivalence between blocks of finite group algebras called a strong isotypy. A strong isotypy is equivalent to a $p$-permutation equivalence and restricts to an isotypy in the sense of Brou\'{e}. To prove these…
In this paper, we prove some supercongruences via the Wilf-Zeilberger method. For instance, for any odd prime $p$ and positive integer $r$ and $\delta\in\{1,2\}$, we have \begin{align*} \sum_{n=0}^{(p^r-1)/\delta}…
A large family of words must contain two words that are similar. We investigate several problems where the measure of similarity is the length of a common subsequence. We construct a family of n^{1/3} permutations on n letters, such that…
The subjects of rook equivalence and Wilf equivalence have both attracted considerable attention over the last half-century. In this paper we introduce a new notion of Wilf equivalence for integer partitions, and, using this notion, we…
We establish a characterization of supernilpotent Mal'cev algebras which generalizes the affine structure of abelian Mal'cev algebras and the recent characterization of 3-supernilpotent Mal'cev algebras. We then show that for varieties in…
A propositional proof system $P$ has the strong feasible disjunction property iff there is a constant $c \geq 1$ such that whenever $P$ admits a size $s$ proof of $\bigvee_i \alpha_i$ with no two $\alpha_i$ sharing an atom then one of…
It is well known that the strong subadditivity theorem is hold for classical system, but it is very difficult to prove that it is hold for quantum system. The first proof of this theorem is due to Lieb by using the Lieb's theorem. Here we…
We study a new class of so-called rational-infinitely (or quasi-infinitely) divisible probability laws on the real line. The characteristic functions of these distributions are ratios of the characteristic functions of classical infinitely…
The dependence with text length of the statistical properties of word occurrences has long been considered a severe limitation quantitative linguistics. We propose a simple scaling form for the distribution of absolute word frequencies…
Building off recent work of Garg and Peng, we continue the investigation into classical and consecutive pattern avoidance in rooted forests, resolving some of their conjectures and questions and proving generalizations whenever possible.…
We launch a systematic study of the refined Wilf-equivalences by the statistics $\mathsf{comp}$ and $\mathsf{iar}$, where $\mathsf{comp}(\pi)$ and $\mathsf{iar}(\pi)$ are the number of components and the length of the initial ascending run…
We establish a super duality as an equivalence between Whittaker module categories over a pair of classical Lie algebra and Lie superalgebra in the infinite-rank limit. Building on this result and utilizing the Losev-Shu-Xiao decomposition,…
The relationship between the large cardinal notions of strong compactness and supercompactness cannot be determined under the standard ZFC axioms of set theory. Under a hypothesis called the Ultrapower Axiom, we prove that the notions are…
Motivated by classification, up to order isomorphism, of some dense subgroups of Euclidean space that are free of minimal rank, we obtain apparently new invariants for an equivalence relation (intermediate between Hermite and Smith) on…