Related papers: Bounded affine permutations I. Pattern avoidance a…
We consider the numerical integration of Langevin equations for particles in a channel, in the presence of boundary conditions fixing the concentration values at the ends. This kind of boundary condition appears for instance when…
We demonstrate a natural bijection between a subclass of alternating sign matrices (ASMs) defined by a condition on the corresponding monotone triangle which we call the gapless condition and a subclass of totally symmetric…
We developed a conformal map technique to analyze the attenuation of edge modes propagating along imperfect boundaries. In systems where the potential energy exhibits conformal invariance, the conformal transformation can straighten the…
We study the total number of occurrences of several vincular (also called generalized) patterns and other statistics, such as the major index and the Denert statistic, on permutations avoiding a pattern of length 3, extending results of…
Recently, Babson and Steingrimsson have introduced generalised permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We consider pattern avoidance for such patterns, and…
The divergence condition is reformulated in the scaled boundary coordinates so as to prevent the spurious solutions in the finite element formulation.
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 investigate permutations in terms of their cycle structure and descent set. To do this, we generalize the classical bijection of Gessel and Reutenauer to deal with permutations that have some ascending and some descending blocks. We then…
The matter-enhanced oscillations of two neutrino flavors are studied using a uniform semiclassical approximation. Unlike some analytic studies which have focused on certain exactly-solvable densities, this method can be used for an…
The research on pattern-avoidance has yielded so far limited knowledge on Wilf-ordering of permutations. The Stanley-Wilf limits sqrt[n](|S_n(tau)|) and further works suggest asymptotic ordering of layered versus monotone patterns. Yet,…
We study gapped boundaries characterized by "fermionic condensates" in 2+1 d topological order. Mathematically, each of these condensates can be described by a super commutative Frobenius algebra. We systematically obtain the species of…
This article introduces an analogue of permutation classes in the context of polyominoes. For both permutation classes and polyomino classes, we present an original way of characterizing them by avoidance constraints (namely, with excluded…
Affine $\lambda$-terms are $\lambda$-terms in which each bound variable occurs at most once and linear $\lambda$-terms are $\lambda$-terms in which each bound variables occurs once. and only once. In this paper we count the number of closed…
In recent years, there has been increasing interest in consecutive pattern avoidance in permutations. In this paper, we introduce two approaches to counting permutations that avoid a set of prescribed patterns consecutively. These algoritms…
We consider $n\times n$ non-Hermitian random matrices with independent entries and a variance profile, as well as an additive deterministic diagonal deformation. We show that their empirical eigenvalue distribution converges to a limiting…
We derive a large deviation principle for random permutations induced by probability measures of the unit square, called permutons. These permutations are called $\mu$-random permutations. We also introduce and study a new general class of…
The Fourier restriction problem asks when it is meaningful to restrict the Fourier transform of a function to a given set. Many of the key examples are smooth co-dimension 1 manifolds, although there is increasing interest in fractal sets.…
In this work of thesis we introduce and study a new family of sorting devices, which we call pattern-avoiding machines. They consist of two stacks in series, equipped with a greedy procedure. On both stacks we impose a static constraint in…
We characterize separable multidimensional permutations in terms of forbidden patterns and enumerate them by means of generating function, recursive formula and explicit formula. We find a connection between multidimensional permutations…
In this paper we calculate the cardinality of the set S_n(T,tau) of all permutations in S_n that avoid one pattern from S_4 and a nonempty set of patterns from S_3.