English
Related papers

Related papers: Random monotone factorisations of the cycle

200 papers

We propose to study factorization breaking effects in exclusive b decays where they are strongly enhanced over the factorizing contributions. This can be done by selecting final-state mesons with a small decay constant or with spin greater…

High Energy Physics - Phenomenology · Physics 2010-02-03 M. Diehl , G. Hiller

Any rational number can be factored into a product of several rationals whose sum vanishes. This simple but nontrivial fact was suggested as a problem on a maths olympiad for high-school students. We completely solve similar questions in…

Rings and Algebras · Mathematics 2020-07-20 Anton A. Klyachko , Anton N. Vassilyev

These are classified by the direction of approximation (from above or below), the set family types (partition or covering) of simple functions, the coefficient signature (non-negative or signed), and cardinal number of terms of simple…

General Mathematics · Mathematics 2021-08-23 Ryoji Fukuda

We study generating functions of ordinary and plane partitions coloured by the action of a finite subgroup of the corresponding special linear group. After reviewing known results for the case of ordinary partitions, we formulate a…

Algebraic Geometry · Mathematics 2020-11-04 Ben Davison , Jared Ongaro , Balazs Szendroi

We discuss a consequence of Green and Tao's factorisation theorem for polynomial orbits on nilmanifolds, adjusted to the requirements of certain arithmetic applications. More precisely, we prove a generalisation of Theorem 16.4, Acta Arith.…

Number Theory · Mathematics 2015-09-22 Lilian Matthiesen

The asymptotic behavior, as $n\rightarrow \infty $ of the probability of the event that a decomposable critical branching process $\mathbf{Z}(m)=(Z_{1}(m),...,Z_{N}(m)),$ $m=0,1,2,...,$ with $N$ types of particles dies at moment $n$ is…

Probability · Mathematics 2015-04-21 Vladimir Vatutin , Elena Dyakonova

We present exponential and super factorial lower bounds on the number of Hamiltonian cycles passing through any edge of the basis graphs of a graphic, generalized Catalan and uniform matroids. All lower bounds were obtained by a common…

We consider a class of 3d theories with a $\mathbb Z_n$ magnetic symmetry in which confinement is generated by charge $n$ clusters of monopoles. Such theories naturally arise in quantum antiferromagnets in 2+1, QCD-like theories on $\mathbb…

High Energy Physics - Theory · Physics 2024-12-20 Mendel Nguyen , Mithat Ünsal

We use methods from combinatorics and algebraic statistics to study analogues of birth-and-death processes that have as their state space a finite subset of the $m$-dimensional lattice and for which the $m$ matrices that record the…

Probability · Mathematics 2010-01-14 Steven N. Evans , Bernd Sturmfels , Caroline Uhler

Factorization theorems for single inclusive jet production play a crucial role in the study of jets and their substructure. In the case of small radius jets, the dynamics of the jet clustering can be factorized from both the hard production…

High Energy Physics - Phenomenology · Physics 2024-10-01 Kyle Lee , Ian Moult , Xiaoyuan Zhang

A sunlet is a cycle with a pendant edge attached at each vertex of the cycle. For the bipartite toroidal grid graphs $C_{2n} \Box C_{2n}$, factorizations into sunlets are given by homomorphisms from disjoint unions of $s$ copies of a sunlet…

Combinatorics · Mathematics 2025-10-22 Henry Jervis , Paul C. Kainen

We introduce a model for stochastic transport on a one-dimensional substrate with particles assuming different conformations during their stepping cycles. These conformations correspond to different footprints on the substrate: in order to…

Statistical Mechanics · Physics 2019-06-26 Yvan Rousset , Luca Ciandrini , Norbert Kern

We describe a relation between the invariants of $n$ ordered points in $P^d$ and of points contained in a union of linear subspaces $P^{d1}\cup P^{d2} \subset P^d$. This yields an attaching map for GIT quotients parameterizing point…

Algebraic Geometry · Mathematics 2016-04-12 Michele Bolognesi , Noah Giansiracusa

We demonstrate a method for proving precise concentration inequalities in uniformly random trees on $n$ vertices, where $n\geq1$ is a fixed positive integer. The method uses a bijection between mappings…

Probability · Mathematics 2020-06-15 Steven Heilman

For a finite field of odd number of elements we construct families of permutation binomials and permutation trinomials with one fixed-point (namely zero) and remaining elements being permuted as disjoint cycles of same length. Binomials and…

Combinatorics · Mathematics 2023-06-28 Anitha G , P Vanchinathan

We consider a discrete-time Markov chain, called fragmentation process, that describes a specific way of successively removing objects from a linear arrangement. The process arises in population genetics and describes the ancestry of the…

Probability · Mathematics 2020-03-17 Ellen Baake , Mareike Esser

An analysis of extensive simulations of interacting self-avoiding polygons on cubic lattice shows that the frequencies of different knots realized in a random, collapsed polymer ring decrease as a negative power of the ranking order, and…

Statistical Mechanics · Physics 2007-08-21 M. Baiesi , E. Orlandini , A. L. Stella

We establish correspondances between factorisations of finite abelian groups (direct factors, unitary factors, non isomorphic subgroup classes) and factorisations of integer matrices. We then study counting functions associated to these…

Number Theory · Mathematics 2007-05-23 Johan Andersson , Gautami Bhowmik

We study the joint distribution of the number of occurrences of members of a collection of nonoverlapping motifs in digital data. We deal with finite and countably infinite collections. For infinite collections, the setting requires that we…

Probability · Mathematics 2016-07-05 Jeffrey Gaither , Hosam Mahmoud , Mark Daniel Ward

Generalizing a formula of Stanley, we prove combinatorially that the probability that $1, 2, \dots, k$ are contained in the same cycle of a product of two random $n$-cycles is \[\frac{1}{k} + \frac{4 (-1)^n}{ \binom{2k}{k}}…

Combinatorics · Mathematics 2025-03-27 Holden Mui
‹ Prev 1 8 9 10 Next ›