English
Related papers

Related papers: Random stable type minimal factorizations of the $…

200 papers

Girth-regular graphs with equal girth, regular degree and chromatic index are studied for the determination of 1-factorizations with each 1-factor intersecting every girth cycle. Applications to hamiltonian decomposability and to…

Combinatorics · Mathematics 2025-10-15 Italo J. Dejter

In this work we are considering the behavior of the limit shape of Young diagrams associated to random permutations on the set $\{1,\dots,n\}$ under a particular class of multiplicative measures. Our method is based on generating functions…

Probability · Mathematics 2014-07-10 Alessandra Cipriani , Dirk Zeindler

The classical Hurwitz numbers count the fixed-length transitive transposition factorizations of a permutation, with a remarkable product formula for the case of minimum length (genus $0$). We study the analogue of these numbers for…

Combinatorics · Mathematics 2022-06-17 Theo Douvropoulos , Joel Brewster Lewis , Alejandro H. Morales

We provide a bijection between the set of factorizations, that is, ordered (n-1)-tuples of transpositions in ${\mathcal S}_{n}$ whose product is (12...n), and labelled trees on $n$ vertices. We prove a refinement of a theorem of D\'{e}nes…

Combinatorics · Mathematics 2016-09-07 Ian Goulden , Alexander Yong

We consider a renewal process \tau={\tau_0,\tau_1,...} on the integers, where the law of \tau_i-\tau_{i-1} has a power-like tail P(\tau_i-\tau_{i-1}=n)=n^{-(\alpha+1)}L(n) with \alpha\ge0 and L(.) slowly varying. We then assign a random,…

Mathematical Physics · Physics 2008-04-28 Fabio Lucio Toninelli

Let $m, n$ be positive integers such that $m>1$ divides $n$. In this paper, we introduce a special class of piecewise-affine permutations of the finite set $[1, n]:=\{1, \ldots, n\}$ with the property that the reduction $\pmod m$ of $m$…

Number Theory · Mathematics 2020-03-13 Lucas Reis , Sávio Ribas

Let $(W_n(\theta))_{n \in \mathbb{N}_0}$ be Biggins' martingale associated with a supercritical branching random walk, and let $W(\theta)$ be its almost sure limit. Under a natural condition for the offspring point process in the branching…

Probability · Mathematics 2017-09-22 Alexander Iksanov , Konrad Kolesko , Matthias Meiners

We consider random mappings on n = kr nodes with preimage sizes restricted to a set of the form {0,k}, where k = k(r) is greater than 1. We prove that T, the least common multiple of the cycle lengths, and B= the product of the cycle…

Combinatorics · Mathematics 2018-10-10 Rodrigo S. V. Martins , Daniel Panario , Claudio Qureshi , Eric Schmutz

The use of the Factorization method for Electrical Impedance Tomography has been proved to be very promising for applications in the case where one wants to find inhomogeneous inclusions in a known background. In many situations, the…

Analysis of PDEs · Mathematics 2015-06-18 Nicolas Chaulet , Simon Arridge , Timo Betcke , David Holder

I review the Thirring model in 2+1$d$ dimensions, focussing in particular on possible strongly-interacting UV-stable fixed points of the renormalisation group, corresponding to a continuous phase transition where a U($2N$) global symmetry…

High Energy Physics - Lattice · Physics 2021-05-21 Simon Hands

Let $k\geq 2$. We show that, for a sufficiently small $\varepsilon>0$, any sufficiently large $n$-vertex Hamiltonian graph of minimum degree at least $n^{1-\varepsilon}$ contains a $2$-factor consisting of exactly $k$ cycles. This is the…

Combinatorics · Mathematics 2026-05-13 Alberto Espuny Díaz , António Girão , Bertille Granet , Gal Kronenberg

We continue the study of Adin, Alon and Roichman [arXiv:2502.14398, 2025] on the number of steps required to sort $n$ labelled points on a circle by transpositions. Imagine that the vertices of a cycle of length $n$ are labelled by the…

Combinatorics · Mathematics 2025-11-04 Paul Bastide , Anurag Bishnoi , Carla Groenland , Dion Gijswijt , Rohinee Joshi

In the Minimum Bisection problem, input is a graph $G$ and the goal is to partition the vertex set into two parts $A$ and $B$, such that $||A|-|B|| \le 1$ and the number $k$ of edges between $A$ and $B$ is minimized. This problem can be…

Data Structures and Algorithms · Computer Science 2023-08-22 Tanmay Inamdar , Daniel Lokshtanov , Saket Saurabh , Vaishali Surianarayanan

We investigate rank revealing factorizations of $m \times n$ polynomial matrices $P(\lambda)$ into products of three, $P(\lambda) = L(\lambda) E(\lambda) R(\lambda)$, or two, $P(\lambda) = L(\lambda) R(\lambda)$, polynomial matrices. Among…

Numerical Analysis · Mathematics 2024-10-04 Andrii Dmytryshyn , Froilán Dopico , Paul Van Dooren

High-order methods gain more and more attention in computational fluid dynamics. However, the potential advantage of these methods depends critically on the availability of efficient elliptic solvers. With spectral-element methods, static…

Numerical Analysis · Computer Science 2017-08-23 Immo Huismann , Jörg Stiller , Jochen Fröhlich

We prove that for any integer $k\geq 2$ and $\varepsilon>0$, there is an integer $\ell_0\geq 1$ such that any $k$-uniform hypergraph on $n$ vertices with minimum codegree at least $(1/2+\varepsilon)n$ has a fractional decomposition into…

Combinatorics · Mathematics 2021-01-15 Felix Joos , Marcus Kühn

We study the soft limit of one-loop QCD amplitudes and we derive the process-independent factorization formula that controls the singular behaviour in this limit. This is obtained from the customary eikonal factorization formula valid at…

High Energy Physics - Phenomenology · Physics 2009-10-31 S. Catani , M. Grazzini

We study the self energies of all particles which appear in a lattice regularization of supersymmetric QCD (${\cal N}=1$). We compute, perturbatively to one-loop, the relevant two-point Green's functions using both the dimensional and the…

High Energy Physics - Lattice · Physics 2017-04-05 M. Costa , H. Panagopoulos

In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…

Combinatorics · Mathematics 2016-11-01 Franck Gabriel

Let $\cal R$ be a set of $n$ colored imprecise points, where each point is colored by one of $k$ colors. Each imprecise point is specified by a unit disk in which the point lies. We study the problem of computing the smallest and the…

Computational Geometry · Computer Science 2022-08-31 Ankush Acharyya , Ramesh K. Jallu , Vahideh Keikha , Maarten Löffler , Maria Saumell
‹ Prev 1 8 9 10 Next ›