Related papers: Combinatorics of normal sequences of braids

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…

We initiate the systematic study of modular representations of symmetric groups that arise via the braiding in (symmetric) tensor categories over fields of positive characteristic. We determine what representations appear for certain…

Grammatical inference is a classical problem in computational learning theory and a topic of wider influence in natural language processing. We treat grammars as a model of computation and propose a novel neural approach to induction of…

The present paper is concerned with the enumeration of the state diagrams for some classes of knot shadows endowed with the usual connected sum operation. We focus on shadows that are recursively generated by knot shadows with up to 3…

We consider the complexity of two questions on polynomials given by arithmetic circuits: testing whether a monomial is present and counting the number of monomials. We show that these problems are complete for subclasses of the counting…

Starting from the seminal example of the greedy normal norm in braid monoids, we analyse the mechanism of the normal form in a Garside monoid and explain how it extends to the more general framework of Garside families. Extending the…

We consider countable linear orders and study the quasi-order of convex embeddability and its induced equivalence relation. We obtain both combinatorial and descriptive set-theoretic results, and further extend our research to the case of…

In this work, we investigate the use of normalizing flows to model conditional distributions. In particular, we use our proposed method to analyze inverse problems with invertible neural networks by maximizing the posterior likelihood. Our…

The paper deals with braided Clifford algebras, understood as Chevalley-Kahler deformations of braided exterior algebras. It is shown that Clifford algebras based on involutive braids can be naturally endowed with a braided quantum group…

String theories with branes can often be generalized by adding brane-antibrane pairs. We explore the cancellation of anomalies in this more general context, extending the familiar anomaly-cancelling mechanisms, both for ten-dimensional…

Random-cluster measures on infinite regular trees are studied in conjunction with a general type of `boundary condition', namely an equivalence relation on the set of infinite paths of the tree. The uniqueness and non-uniqueness of…

We consider two problems that appear at first sight to be unrelated. The first problem is to count certain diagrams consisting of noncrossing arcs in the plane. The second problem concerns the weak order on the symmetric group. Each…

Braids can be represented geometrically as curve diagrams. The geometric complexity of a braid is the minimal complexity of a curve diagram representing it. We introduce and study the corresponding notion of geometric generating function.…

In this work we obtain recurrent formulae for the number of permutations with either increasing or monotonic (i.e., both increasing and decreasing) runs of bounded length. Our formulae allow one to efficiently compute the number of such…

We consider colored compositions where only some parts are allowed different colors, depending on their locations in the composition. The counting sequences are obtained through generating functions. Connections to many other combinatorial…

We compare two crossed homomorphisms on a braid group, one defined diagrammatically and the other defined algebraically. We show that these crossed homomorphisms are essentially the same, and compute them in detail for simple braids, namely…

We study joint distributions of cycles and patterns in permutations written in standard cycle form. We explore both classical and generalised patterns of length 2 and 3. Many extensions of classical theory are achieved; bivariate generating…

We all are fascinated by the phenomena of intelligent behavior, as generated both by our own brains and by the brains of other animals. As physicists we would like to understand if there are some general principles that govern the structure…

Why do natural and interesting sequences often turn out to be log-concave? We give one of many possible explanations, from the viewpoint of "standard conjectures". We illustrate with several examples from combinatorics.

In this paper I argue that infinities in the classical computation theory such as the unsolvability of the Halting Problem can be addressed in the same way as Feynman divergences in Quantum Field Theory, and that meaningful versions of…