English
Related papers

Related papers: Random monotone factorisations of the cycle

200 papers

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…

Computational Complexity · Computer Science 2019-04-03 Mrinal Kumar , Ben Lee Volk

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)…

Classical Analysis and ODEs · Mathematics 2018-05-08 Leanne Mezuman , Sergei Yakovenko

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…

Data Structures and Algorithms · Computer Science 2016-11-23 Sumit Kumar Jha

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.

Algebraic Geometry · Mathematics 2011-01-28 G. Guibert , F. Loeser , M. Merle

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…

Rings and Algebras · Mathematics 2011-10-11 Miguel Couceiro , Tamás Waldhauser

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…

Combinatorics · Mathematics 2017-05-30 Denis Chebikin , Richard Ehrenborg , Pavlo Pylyavskyy , Margaret Readdy

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…

Combinatorics · Mathematics 2021-04-07 Lukas Nabergall

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…

Probability · Mathematics 2020-02-04 Dirk Zeindler

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…

Probability · Mathematics 2015-01-20 Achillefs Tzioufas

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…

High Energy Physics - Phenomenology · Physics 2013-05-30 Daniel Goetz , Christopher Schwan , Stefan Weinzierl

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…

Group Theory · Mathematics 2018-08-23 Cihan Bahran

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…

Number Theory · Mathematics 2022-07-26 Michael Filaseta

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…

Rings and Algebras · Mathematics 2017-04-25 Anton A. Klyachko , Andrey M. Mazhuga , Anastasia N. Ponfilenko

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…

Category Theory · Mathematics 2014-06-11 Scott Balchin

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…

Other Condensed Matter · Physics 2016-08-31 Ofir E. Alon , Lorenz S. Cederbaum

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…

Combinatorics · Mathematics 2023-01-18 Valentin Goranko , Ruaan Kellerman , Alberto Zanardo

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…

Rings and Algebras · Mathematics 2017-06-13 Daniel Smertnig

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…

Computational Complexity · Computer Science 2018-07-11 Pascal Koiran , Nicolas Ressayre

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.

Number Theory · Mathematics 2020-11-10 Giacomo Cherubini , Pavlo Yatsyna

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…

Representation Theory · Mathematics 2007-05-23 Philippe Biane