Related papers: On Hyperoctahedral Enumeration System, Application…
An oriented hypergraph is an oriented incidence structure that extends the concept of a signed graph. We introduce hypergraphic structures and techniques central to the extension of the circuit classification of signed graphs to oriented…
Generalizations of linear numeration systems in which the set of natural numbers is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of…
Noting that cycle diagrams of permutations visually resemble grid diagrams used to depict knots and links in topology, we consider the knot (or link) obtained from the cycle diagram of a permutation. We show that the permutations which…
We study the joint distribution of descents and sign for elements of the symmetric group and the hyperoctahedral group (Coxeter groups of types $A$ and $B$). For both groups, this has an application to riffle shuffling: for large decks of…
$O(N)$ invariants are the observables of real tensor models. We use regular colored graphs to represent these invariants, the valence of the vertices of the graphs relates to the tensor rank. We enumerate $O(N)$ invariants as $d$-regular…
We produce, on general homogeneous groups, an analogue of the usual H\"ormander pseudodifferential calculus on Euclidean space, at least as far as products and adjoints are concerned. In contrast to earlier works, we do not limit ourselves…
We provide a recursive description of the signatures realizable on the standard basis by a holographic algorithm. The description allows us to prove tight bounds on the size of planar matchgates and efficiently test for standard signatures.…
Representations of sets are challenging to learn because operations on sets should be permutation-invariant. To this end, we propose a Permutation-Optimisation module that learns how to permute a set end-to-end. The permuted set can be…
Permutation codes are a class of structured vector quantizers with a computationally-simple encoding procedure based on sorting the scalar components. Using a codebook comprising several permutation codes as subcodes preserves the…
We discuss both simple and more subtle connections between the numbers of permutations and full cycles with some restrictions,in particular, between the numbers of permutations and full cycles with prescribed up-down structure.
The simple permutations in two permutation classes --- the 321-avoiding permutations and the skew-merged permutations --- are enumerated using a uniform method. In both cases, these enumerations were known implicitly, by working backwards…
What is the higher-dimensional analog of a permutation? If we think of a permutation as given by a permutation matrix, then the following definition suggests itself: A d-dimensional permutation of order n is an [n]^(d+1) array of zeros and…
Units of measure with prefixes and conversion rules are given a formal semantic model in terms of categorial group theory. Basic structures and both natural and contingent semantic operations are defined. Conversion rules are represented as…
The classical derangement numbers count fixed point-free permutations. In this paper we study the enumeration problem of generalized derangements, when some of the elements are restricted to be in distinct cycles in the cycle decomposition.…
In this paper, we study the high-order phase transition in random $r$-uniform hypergraphs. For a positive integer $n$ and a real $p\in [0,1]$, let $H:=H^r(n,p)$ be the random $r$-uniform hypergraph with vertex set $[n]$, where each $r$-set…
The Holant theorem is a powerful tool for studying the computational complexity of counting problems in the Holant framework. Due to the great expressiveness of the Holant framework, a converse to the Holant theorem would itself be a very…
We study permutations on n elements preserving orientation (parity) of every subset of size k. We describe all groups of these permutations. Unexpectedly, these groups (except for some special cases) are either trivial, cyclic or dihedral.…
A permutohedral variety is a remarkable object in various areas of mathematics, and its topological invariants are widely recognized. However, only little is known about a real permutohedral variety, that is, the real locus of a…
RO*-algebras are defined and studied. For RO*-algebra T, using properties of partial order, it is established that the set of bounded elements can be endowed with C*-norm. The structure of commutative subalgebras of T is considered and the…
Numeral systems across the world's languages vary in fascinating ways, both regarding their synchronic structure and the diachronic processes that determined how they evolved in their current shape. For a proper comparison of numeral…