Related papers: On super-strong Wilf equivalence classes of permut…

We consider two orthogonal points of view on finite permutations, seen as pairs of linear orders (corresponding to the usual one line representation of permutations as words) or seen as bijections (corresponding to the algebraic point of…

With Zipf's law being originally and most famously observed for word frequency, it is surprisingly limited in its applicability to human language, holding over no more than three to four orders of magnitude before hitting a clear break in…

We complete the Wilf classification of signed patterns of length 5 for both signed permutations and signed involutions. New general equivalences of patterns are given which prove Jaggard's conjectures concerning involutions in the symmetric…

Most of various large-size complex systems in nature and society can be well described as complex networks (graphs) to better understand the evolutional mechanisms and dynamical functions behind themselves. Of some part follow scale-free…

There is a surprising isomorphism between the quantised universal enveloping algebras of osp(1|2n) and so(2n+1). This same isomorphism emerged in recent work of Mikhaylov and Witten in the context of string theory as a T-duality composed…

We consider two-variable first-order logic on finite words with a fixed number of quantifier alternations. We show that all languages with a neutral letter definable using the order and finite-degree predicates are also definable with the…

Let $A$ be a unital separable \CA and $B=C\otimes {\cal K},$ where $C$ is a unital \CA. Let $\tau: A\to M(B)/B$ be a weakly unital full essential extensions of $A$ by $B.$ We show that there is a bijection between a quotient group of…

In this paper, we compute and demonstrate the equivalence of the joint distribution of the first letter and descent statistics on six avoidance classes of permutations corresponding to two patterns of length four. This distribution is in…

Let $\mathsf{TT}^2_k$ denote the combinatorial principle stating that every $k$-coloring of pairs of compatible nodes in the full binary tree has a homogeneous solution, i.e. an isomorphic subtree in which all pairs of compatible nodes have…

A (positive definite and integral) quadratic form $f$ is said to be $\textit{universal}$ if it represents all positive integers, and is said to be $\textit{primitively universal}$ if it represents all positive integers primitively. We also…

When one studies the structure (e.g. graded ideals, graded subspaces, radicals, ...) or graded polynomial identities of graded algebras, the grading group itself does not play an important role, but can be replaced by any other group that…

Recently, it has been determined that there are 242 Wilf classes of triples of 4-letter permutation patterns by showing that there are 32 non-singleton Wilf classes. Moreover, the generating function for each triple lying in a non-singleton…

To the full order in fermions, we construct D=10 type II supersymmetric double field theory. We spell the precise N=2 supersymmetry transformation rules as for 32 supercharges. The constructed action unifies type IIA and IIB supergravities…

In order to make argumentation-based inference contestable, it is crucial to explain what changes can achieve a desired (instead of the contested) inference result. To this end, we introduce strength change explanations for quantitative…

Weakly globular double categories are a model of weak $2$-categories based on the notion of weak globularity, and they are known to be suitably equivalent to Tamsamani $2$-categories. Fair $2$-categories, introduced by J. Kock, model weak…

Motivated by a question and some enumerative conjectures of Richard Stanley, we explore the equivalence classes of words in the Weyl algebra, $\mathbf{k} \left< D,U \mid DU - UD = 1 \right>$. We show that each class is generated by the…

We apply the supplementation trick [26] to the Green-Schwarz superstring. For type IIB theory both first and second class constraints are covariantly separated and then arranged into irreducible sets in the initial formulation. For N=1…

We show that Weak Vop\v{e}nka's Principle, which is the statement that the opposite category of ordinals cannot be fully embedded into the category of graphs, is equivalent to the large cardinal principle Ord is Woodin, which says that for…

We study a conservative extension of classical propositional logic distinguishing between four modes of statement: a proposition may be affirmed or denied, and it may be strong or classical. Proofs of strong propositions must be…

We introduce the definability strength of combinatorial principles. In terms of definability strength, a combinatorial principle is strong if solving a corresponding combinatorial problem could help in simplifying the definition of a…