Related papers: Random monotone factorisations of the cycle
We study the problem of constructing explicit families of matrices which cannot be expressed as a product of a few sparse matrices. In addition to being a natural mathematical question on its own, this problem appears in various…
We study the problem of decomposition (non-commutative factorization) of linear ordinary differential operators near an irregular singular point. The solution (given in terms of the Newton diagram and the respective characteristic numbers)…
We establish asymptotic expansions for factorial moments of following distributions: number of cycles in a random permutation, number of inversions in a random permutation, and number of comparisons used by the randomized quick sort…
We compute the motivic nearby cycles of functions obtained by composition with a polynomial which is non-degenerate with respect to its Newton polyhedron. Our result involves new convolution operators and generalized nearby cycles.
In this paper we consider an aggregation model f: X1 x ... x Xn --> Y for arbitrary sets X1, ..., Xn and a finite distributive lattice Y, factorizable as f(x1, ..., xn) = p(u1(x1), ..., un(xn)), where p is an n-variable lattice polynomial…
We introduce the notion of the descent set polynomial as an alternative way of encoding the sizes of descent classes of permutations. Descent set polynomials exhibit interesting factorization patterns. We explore the question of when…
We build on recent work of Yeats, Courtiel, and others involving connected chord diagrams. We first derive from a Hopf-algebraic foundation a class of tree-like functional equations and prove that they are solved by weighted generating…
We study the asymptotic behavior of the long cycles of a random permutation of $n$ objects with respect to multiplicative measures with polynomial growing cycle weights. We show that the longest cycle and the length differences between the…
The branching random walk is shown to be monotone decreasing in ascending direction of integer lattices as a corollary of an observation in regard to the lineage of particles from antisymmetric initial states, and a related property of…
We extend the dipole formalism for massless and massive partons to random polarisations of the external partons. The dipole formalism was originally formulated for spin-summed matrix elements and later extended to individual helicity…
For a fixed prime $p$, we consider a filtration of the commuting complex of elements of order $p$ in the symmetric group $\mathfrak{S}_n$. The filtration is obtained by imposing successively relaxed bounds on the number of disjoint…
This paper addresses the factorization of polynomials of the form $F(x) = f_{0}(x) + f_{1}(x) x^{n} + \cdots + f_{r-1}(x) x^{(r-1)n} + f_{r}(x) x^{rn}$ where $r$ is a fixed positive integer and the $f_{j}(x)$ are fixed polynomials in…
We prove that, in any field of characteristic not two and not three except the five-element field, each element decomposes into a product of four factors whose sum vanishes. We also find all $k,n,q$ such that every $n\times n$ matrix over…
We construct an iterative method for factorising small strict n-categories into a unique (up to isomorphism) collection of small 1- categories. Following this we develop the theory to include a large class of $\infty$-categories. We use…
For small scattering lengths, cold bosonic atoms form a condensate the density profile of which is smooth. With increasing scattering length, the density {\it gradually} acquires more and more oscillations. Finally, the number of…
Trees are partial orders in which every element has a linearly ordered set of predecessors. Here we initiate the exploration of the structural theory of trees with the study of different notions of \emph{branching in trees} and of…
We survey results on factorizations of non zero-divisors into atoms (irreducible elements) in noncommutative rings. The point of view in this survey is motivated by the commutative theory of non-unique factorizations. Topics covered include…
This paper is devoted to the factorization of multivariate polynomials into products of linear forms, a problem which has applications to differential algebra, to the resolution of systems of polynomial equations and to Waring decomposition…
In this paper, we study dilation of cyclic polytopes with the vertices defined by a generator of the simplest cubic fields. In particular, for a specific range of values, we give a precise number of the contained lattice points.
We prove a factorization-concentration result for characters of symmetric groups. This is then applied to the asymptotic behaviour of the decomposition of the tensor representations. There are connections with the Pastur-Marcenko…