Related papers: Sub-families of Baxter Permutations Based on Patte…
A permutation is called covexillary if it avoids the pattern $3412$. We construct an open embedding of a covexillary matrix Schubert variety into a Grassmannian Schubert variety. As applications of this embedding, we show that the…
Detecting and counting copies of permutation patterns are fundamental algorithmic problems, with applications in the analysis of rankings, nonparametric statistics, and property testing tasks such as independence and quasirandomness…
We consider the enumeration of pattern-avoiding involutions, focusing in particular on sets defined by avoiding a single pattern of length 4. As we demonstrate, the numerical data for these problems demonstrates some surprising behavior.…
A family F of permutations of the vertices of a hypergraph H is called "pairwise suitable" for H if, for every pair of disjoint edges in H, there exists a permutation in F in which all the vertices in one edge precede those in the other.…
The study of pattern containment and avoidance for linear permutations is a well-established area of enumerative combinatorics. A cyclic permutation is the set of all rotations of a linear permutation. Callan initiated the study of…
We give new tools for homotopy Brouwer theory. In particular, we describe a canonical reducing set (the set of "walls") which splits the plane into maximal translation areas and irreducible areas. We then focus on Brouwer mapping classes…
We develop basic constructions of the Baxter operator formalism for the Macdonald polynomials associated with root systems of type A. Precisely we construct a dual pair of mutually commuting Baxter operators such that the Macdonald…
We initiate a systematic study of pattern avoidance in rectangulations. We give a formal definition of such patterns and investigate rectangulations that avoid $\top$-like patterns - the pattern $\top$ and its rotations. For every $L…
We describe birational representations of discrete groups generated by involutions, having their origin in the theory of exactly solvable vertex-models in lattice statistical mechanics. These involutions correspond respectively to two kinds…
The active bijection for oriented matroids (and real hyperplane arrangements, and graphs, as particular cases) is introduced and investigated by the authors in a series of papers. Given any oriented matroid defined on a linearly ordered…
A matching of the set $[2n]=\{ 1,2,\ldots ,2n\}$ is a partition of $[2n]$ into blocks with two elements, i.e. a graph on $[2n]$ such that every vertex has degree one. Given two matchings $\sigma$ and $\tau$ , we say that $\sigma$ is a…
We present a generating function and a closed counting formula in two variables that enumerate a family of classes of permutations that avoid or contain an increasing pattern of length three and have a prescribed number of occurrences of…
Approximate Bayesian Computation (ABC) methods have become essential tools for performing inference when likelihood functions are intractable or computationally prohibitive. However, their scalability remains a major challenge in…
To approximate a simple root of an equation we construct families of iterative maps of higher order of convergence. These maps are based on model functions which can be written as an inner product. The main family of maps discussed is…
In this paper we study several variations of the \emph{pancake flipping problem}, which is also well known as the problem of \emph{sorting by prefix reversals}. We consider the variations in the sorting process by adding with prefix…
One of the main goals of design theory is to classify, characterize and count various combinatorial objects with some prescribed properties. In most cases, however, one quickly encounters a combinatorial explosion and even if the complete…
The concept of Rota-Baxter family algebra is a generalization of Rota-Baxter algebra. It appears naturally in the algebraic aspects of renormalizations in quantum field theory. Rota-Baxter family algebras are closely related to dendriform…
A Baxter algebra is a commutative algebra $A$ that carries a generalized integral operator. In the first part of this paper we review past work of Baxter, Miller, Rota and Cartier in this area and explain more recent work on explicit…
Billey, Jockusch, and Stanley characterized 321-avoiding permutations by a property of their reduced decompositions. This paper generalizes that result with a detailed study of permutations via their reduced decompositions and the notion of…
We consider a sorting machine consisting of two stacks in series where the first stack has the added restriction that entries in the stack must be in decreasing order from top to bottom. The class of permutations sortable by this machine…