Related papers: On partial well-order for monotone grid classes of…
Machines whose main purpose is to permute and sort data are studied. The sets of permutations that can arise are analysed by means of finite automata and avoided pattern techniques. Conditions are given for these sets being enumerated by…
In this article we introduce and study a class of finite groups for which the orders of normal subgroups satisfy a certain inequality. It is closely connected to some well-known arithmetic classes of natural numbers.
This paper includes new bounds concepting the vanishing generalized weighted Morrey space. In this sense, it is outlined improved bounds about the a class of fractional type rough higher order commutators on vanishing generalized weighted…
Permutation matrices play an important role in understand the structure of magic squares. In this work, we use a class of symmetric permutation matrices than can be used to categorize magic squares. Many magic squares with a high degree of…
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, and beyond. The purpose of this paper is to illustrate the…
We study preferential attachment (PA) trees with general attachment functions. PA suggests an intuitive monotonicity: if high-degree vertices are rewarded more strongly, then the resulting tree should become shallower. We examine this…
Justification theory is an abstract unifying formalism that captures semantics of various non-monotonic logics. One intriguing problem that has received significant attention is the consistency problem: under which conditions are…
We propose a relaxation to the definition of well-structured transition systems (\WSTS) while retaining the decidability of boundedness and non-termination. In this class, the well-quasi-ordered (wqo) condition is relaxed such that it is…
Ordered, linear, and other substructural type systems allow us to expose deep properties of programs at the syntactic level of types. In this paper, we develop a family of unary logical relations that allow us to prove consequences of…
A Schubert class is called rigid if it can only be represented by Schubert varieties. The rigid Schubert classes have been classified in Grassmannians and orthogonal Grassmannians. In this paper, we study the rigidity problem in partial…
We prove that braid group representations associated to braided fusion categories and mapping class group representations associated to modular fusion categories are always semisimple. The proof relies on the theory of extensions in…
Monotone triangles are a rich extension of permutations that biject with alternating sign matrices. The notions of weak order and descent sets for permutations are generalized here to monotone triangles, and shown to enjoy many analogous…
The primitive finite permutation groups containing a cycle are classified. Of these, only the alternating and symmetric groups contain a cycle fixing at least three points. The contributions of Jordan and Marggraff to this topic are briefly…
In this article we provide an intrinsic characterization of the famous Howard-Bachmann ordinal in terms of a natural well-partial-ordering by showing that this ordinal can be realized as a maximal order type of a class of generalized trees…
We present families of combinatorial classes described as trees with nodes that can carry one of two types of "flowers": integer partitions or integer compositions. Two parameters on the flowers of trees will be considered: the number of…
A finite group is said to have "perfect order classes" if the number of elements of any given order is either zero or a divisor of the order of the group. The purpose of this note is to describe explicitly the finite Hamiltonian groups with…
We propose a quantitative notion of permutation stability for finitely generated groups. Our notion is related to, but distinct from, the ``stability rate'' introduced by Becker and Mosheiff (which is valid within the class of finitely…
Given a category with a bifunctor and natural isomorphisms for associativity, commutativity and left and right identity we do not assume that extra constraining diagrams hold. We introduce groupoids of coupling trees to describe a version…
Metrics on rooted phylogenetic trees are integral to a number of areas of phylogenetic analysis. Cluster-similarity metrics have recently been introduced in order to limit skew in the distribution of distances, and to ensure that trees in…
Matatyahu Rubin has shown that a sharp version of Vaught's conjecture, $I({\mathcal T},\omega )\in \{ 0,1,{\mathfrak{c}}\}$, holds for each complete theory of linear order ${\mathcal T}$. We show that the same is true for each complete…