English
Related papers

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

200 papers

These expository notes are centered around the circular law theorem, which states that the empirical spectral distribution of a nxn random matrix with i.i.d. entries of variance 1/n tends to the uniform law on the unit disc of the complex…

Probability · Mathematics 2012-03-14 Charles Bordenave , Djalil Chafai

Let $S_n$ denote the group all permutations of $n$. For every permutation $\sigma$, we let $\mathrm{des}(\sigma)$ denote the number of descents in $\sigma$ and $\mathrm{LRMin}(\sigma)$ denote the number of left-to-right minima of $\sigma$.…

Combinatorics · Mathematics 2017-02-28 Quang T. Bach , Jeffrey B. Remmel

Akin to the Erd\H{o}s-Rademacher problem, Linial and Morgenstern made the following conjecture in tournaments: for any $d\in (0,1]$, among all $n$-vertex tournaments with $d\binom{n}{3}$ many 3-cycles, the number of 4-cycles is…

Combinatorics · Mathematics 2020-12-01 Jie Ma , Tianyun Tang

A manifestly gauge invariant and regularized renormalization group flow equation is constructed for pure SU(N) gauge theory in the large N limit. In this way we make precise and concrete the notion of a non-perturbative gauge invariant…

High Energy Physics - Theory · Physics 2009-12-10 Tim R. Morris

In the study of factorizations of finite cyclic groups, a classical problem is to investigate the properties of factorization sets $A$ and $B$ in the direct sum decomposition $A \oplus B = \mathbb{Z}_{M}$ with $|A| = |B| =\sqrt{M}$, where…

Combinatorics · Mathematics 2026-03-02 Xin-Rong Dai

At long times, a fractional Brownian particle in a confining external potential reaches a non-equilibrium (non-Boltzmann) steady state. Here we consider scale-invariant power-law potentials $V(x)\sim |x|^m$, where $m>0$, and employ the…

Statistical Mechanics · Physics 2025-03-03 Baruch Meerson , Pavel V. Sasorov

Spatial random permutations were originally studied due to their connections to Bose-Einstein condensation, but they possess many interesting properties of their own. For random permutations of a regular lattice with periodic boundary…

Probability · Mathematics 2015-06-17 Volker Betz

Linial's seminal result shows that any deterministic distributed algorithm that finds a $3$-colouring of an $n$-cycle requires at least $\log^*(n)/2 - 1$ communication rounds. We give a new simpler proof of this theorem.

Distributed, Parallel, and Cluster Computing · Computer Science 2014-02-12 Juhana Laurinharju , Jukka Suomela

We settle the complexity of the $(\Delta+1)$-coloring and $(\Delta+1)$-list coloring problems in the CONGESTED CLIQUE model by presenting a simple deterministic algorithm for both problems running in a constant number of rounds. This…

Data Structures and Algorithms · Computer Science 2020-09-15 Artur Czumaj , Peter Davies , Merav Parter

We give a compact expression for the number of factorizations of any permutation into a minimal number of transpositions of the form $(1 i)$. Our result generalizes earlier work of Pak in which substantial restrictions were placed on the…

Combinatorics · Mathematics 2014-05-21 John Irving , Amarpreet Rattan

We propose a number of tests of factorization for the color-suppressed nonleptonic decay channels: $B \to K^{(*)} \; \eta_c$ and $B \to K^{(*)} \; \eta^\prime_c$. The relevant leptonic constants and form factors are calculated within the…

High Energy Physics - Phenomenology · Physics 2016-09-01 P. Colangelo , C. A. Dominguez , N. Paver

We define a notion of substitution on colored binary trees that we call substreetution. We show that a fixed point by a substreetution may be (or not) almost periodic, thus the closure of the orbit under $\mathbb{F}_2^+$-action may (or not)…

Dynamical Systems · Mathematics 2022-01-07 A. Baraviera , R. Leplaideur

The magnetically ordered, low temperature phase of Ising ferro- magnets is manifested within the associated Fortuin-Kasteleyn (FK) random cluster representation by the occurrence of a single positive density percolating cluster. In this…

Statistical Mechanics · Physics 2008-05-08 J. Machta , C. M. Newman , D. L. Stein

A formalism based on the fermionic functional-renormalization-group approach to interacting electron models defined on a lattice is presented. One-loop flow equations for the coupling constants and susceptibilities in the particle-particle…

Strongly Correlated Electrons · Physics 2024-08-21 Lucas Désoppi , Nicolas Dupuis , Claude Bourbonnais

I study the canonical formulation and quantization of some simple parametrized systems, including the non-relativistic parametrized particle and the relativistic parametrized particle. Using Dirac's formalism I construct for each case the…

General Relativity and Quantum Cosmology · Physics 2007-05-23 G. Ruffini

Many observables in QCD rely upon the resummation of perturbation theory to retain predictive power. Resummation follows after one factorizes the cross section into the rele- vant modes. The class of observables which are sensitive to soft…

High Energy Physics - Phenomenology · Physics 2015-06-04 Jui-yu Chiu , Ambar Jain , Duff Neill , Ira Z. Rothstein

We study factorization and dilation properties of Markov maps between von Neumann algebras equipped with normal faithful states, i.e., completely positive unital maps which preserve the given states and also intertwine their automorphism…

Operator Algebras · Mathematics 2015-05-19 Uffe Haagerup , Magdalena Musat

Employing the QCD factorization formalism we compute $B_{u}^{-} \to \gamma^{\ast} \, \ell \, \bar \nu_{\ell}$ form factors with an off-shell photon state possessing the virtuality of order $m_b \, \Lambda_{\rm QCD}$ and $m_b^2$,…

High Energy Physics - Phenomenology · Physics 2022-03-09 Chao Wang , Yu-Ming Wang , Yan-Bing Wei

The distribution of the characteristic polynomial $Z(U,\theta)$ of $N\times N$ matrices $U$ in the Circular Unitary Ensemble is studied by the method of second quantization for one-dimensional fermions. For infinite $N$ the Gaussian…

Chaotic Dynamics · Physics 2008-11-26 Dimitry M. Gangardt

A subset of $[n] = \{1,2,\ldots,n\}$ is called stable if it forms an independent set in the cycle on the vertex set $[n]$. In 1978, Schrijver proved via a topological argument that for all integers $n$ and $k$ with $n \geq 2k$, the family…

Data Structures and Algorithms · Computer Science 2023-07-04 Ishay Haviv