Related papers: Random monotone factorisations of the cycle
We study the non-uniqueness of factorizations of non zero-divisors into atoms (irreducibles) in noncommutative rings. To do so, we extend concepts from the commutative theory of non-unique factorizations to a noncommutative setting. Several…
Traditional NMF-based signal decomposition relies on the factorization of spectral data, which is typically computed by means of short-time frequency transform. In this paper we propose to relax the choice of a pre-fixed transform and learn…
Starting with a symmetric monoidal adjunction with certain properties, one derives another symmetric monoidal adjunction with the same properties between the respective categories of all V-categories. If one begins with a reflection of a…
This paper studies the problem of decomposing a low-rank matrix into a factor with binary entries, either from $\{\pm 1\}$ or from $\{0,1\}$, and an unconstrained factor. The research answers fundamental questions about the existence and…
We count factorizations of Singer cycles as products of reflections in the families of special and general unitary and linear groups over a finite field. In the case of minimum-length factorizations, the resulting answer is a striking…
We consider large-dimensional dynamical systems involving a linear force and a random force comprising both potential and non-conservative contributions. Such systems are known to exhibit a topological trivialization phase transition as the…
For each $n > 0$ there is a one complex parameter family of homeomorphisms of the circle consisting of linear fractional transformations `conjugated by $z \to z^n$'. We show that these families are free of relations, which determines the…
We continue the study of properties related to monotone countable paracompactness, investigating various monotone versions of $\delta$-normality. We factorize monotone normality and stratifiability in terms of these weaker properties.
We study the mixing properties of permutations obtained as a product of two uniformly random permutations of fixed cycle types. For instance, we give an exact formula for the probability that elements $1,2,...,k$ are in distinct cycles of…
In this paper we investigate the complexity-theoretical aspects of cyclic and non-wellfounded proofs in the context of parsimonious logic, a variant of linear logic where the exponential modality ! is interpreted as a constructor for…
We consider GL_n(F_q)-analogues of certain factorization problems in the symmetric group S_n: rather than counting factorizations of the long cycle (1, 2, ..., n) given the number of cycles of each factor, we count factorizations of a…
We focus on two important classes of lattices, the well-rounded and the cyclic. We show that every well-rounded lattice in the plane is similar to a cyclic lattice, and use this cyclic parameterization to count planar well-rounded…
We discuss the problem of factorisation of the symmetric Macdonald polynomials and present the obtained results for the cases of 2 and 3 variables.
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…
We explore the relation between resummation and explicit multi-loop calculations for QCD hard-scattering amplitudes. We describe how the factorization properties of amplitudes lead to the exponentiation of double and single poles at each…
We explore the connection between the factorisation of virtual corrections to multi-particle massless gauge theory amplitudes and the problem of subtraction at NNLO and beyond. Taking inspiration from virtual factorisation, we provide a set…
The classical derangement numbers count fixed point-free permutations. In this paper we study the enumeration problem of generalized derangements, when some of the elements are restricted to be in distinct cycles in the cycle decomposition.…
Recent work by Huang, Lewis, Morales, Reiner, and Stanton suggests that the regular elliptic elements of $\mathrm{GL}_n \mathbb{F}_q$ are somehow analogous to the $n$-cycles of the symmetric group. In 1981, Stanley enumerated the…
We describe a simple approach to factorize non-commutative (nc) polynomials, that is, elements in free associative algebras (over a commutative field), into atoms (irreducible elements) based on (a special form of) their minimal linear…
Let $f(n)$ be an arithmetic function with $f(1)\neq0$ and let $f^{-1}(n)$ be its reciprocal with respect to the Dirichlet convolution. We study the asymptotic behaviour of $|f^{-1}(n)|$ with regard to the asymptotic behaviour of $|f(n)|$…