English
Related papers

Related papers: Asymptotic Transfer in Critical Recursive Composit…

200 papers

Let $\{a_\rr : \rr \in (\Z^+)^d \}$ be a $d$-dimensional array of numbers, for which the generating function $F(\zz) := \sum_\rr a_\rr \zz^\rr$ is meromorphic in a neighborhood of the origin. For example, $F$ may be a rational multivariate…

Combinatorics · Mathematics 2009-09-29 Robin Pemantle , Mark C. Wilson

If a unitary transformation has a decomposition into a quantum circuit with no directed path from input $a$ to output $b$, then $a$ does not influence $b$ through the overall unitary. Conversely, it is known that if $a$ does not influence…

Quantum Physics · Physics 2025-08-19 Tein van der Lugt , Robin Lorenz

Analytic combinatorics studies asymptotic properties of families of combinatorial objects using complex analysis on their generating functions. In their reference book on the subject, Flajolet and Sedgewick describe a general approach that…

Combinatorics · Mathematics 2025-08-28 Carine Pivoteau , Bruno Salvy

Composition schemes are ubiquitous in combinatorics, statistical mechanics and probability theory. We give a unifying explanation to various phenomena observed in the combinatorial and statistical physics literature in the context…

Combinatorics · Mathematics 2024-07-22 Cyril Banderier , Markus Kuba , Stephan Wagner , Michael Wallner

Let $F$ be a distribution function on $\mathbb{R}$ with $F(0) = 0 $ and density $f$. Let $\tilde{F}$ be the distribution function of $X_1 - X_2$, $X_i\sim F,\, i=1,2,\text{ iid}$. We show that for a critical Hawkes process with displacement…

Probability · Mathematics 2017-06-14 Matthias Kirchner

A foundational theory of compositional categorical rewriting theory is presented, based on a collection of fibration-like properties that collectively induce and intrinsically structure the large collection of lemmata used in the proofs of…

Logic in Computer Science · Computer Science 2023-07-17 Nicolas Behr , Russ Harmer , Jean Krivine

Many natural combinatorial quantities can be expressed by counting the number of homomorphisms to a fixed relational structure. For example, the number of 3-colorings of an undirected graph $G$ is equal to the number of homomorphisms from…

Computational Complexity · Computer Science 2017-10-03 Hubie Chen

Consider a family $\mathcal{T}$ of 3-connected graphs of moderate growth, and let $\mathcal{G}$ be the class of graphs whose 3-connected components are graphs in $\mathcal{T}$. We present a general framework for analyzing such graphs…

Combinatorics · Mathematics 2009-07-03 Omer Gimenez , Marc Noy , Juanjo Rue

Post-training is routinely evaluated through aggregate benchmark scores that treat multi-hop reasoning as a single capability -- as if a model that answers more questions correctly must be better at assembling facts. We show that this…

Artificial Intelligence · Computer Science 2026-05-27 Zhe Yu , Wenpeng Xing , Yunzhao Wei , Jie Chen , Hongzhi Wang , Xuyang Teng , Meng Han

We introduce the notion of combinatorial encoding of continuous dynamical systems and suggest the first examples, which are the most interesting and important, namely, the combinatorial encoding of a Bernoulli process with continuous state…

Dynamical Systems · Mathematics 2019-11-05 Anatoly Vershik

Compositional data are commonly known as multivariate observations carrying relative information. Even though the case of vector or even two-factorial compositional data (compositional tables) is already well described in the literature,…

Methodology · Statistics 2022-01-26 Kamila Fačevicová , Peter Filzmoser , Karel Hron

Interventional causal models describe several joint distributions over some variables used to describe a system, one for each intervention setting. They provide a formal recipe for how to move between the different joint distributions and…

Machine Learning · Statistics 2021-08-06 Eigil F. Rischel , Sebastian Weichwald

Interacting physical systems in the neighborhood of criticality (and massive continuum field theories) can often be characterized by just two physical scales: a (macroscopic) correlation length and a (microscopic) interaction range, related…

High Energy Physics - Lattice · Physics 2009-10-31 Sergio Caracciolo , Maria Serena Causo , Andrea Pelissetto , Paolo Rossi , Ettore Vicari

The DisCoCirc framework for natural language processing allows the construction of compositional models of text, by combining units for individual words together according to the grammatical structure of the text. The compositional nature…

Computation and Language · Computer Science 2025-07-08 Tiffany Duneau

A finite spin system invariant under a symmetry group G is a very illustrative example of the finite group action on a set of mappings f:X->Y. In the case of spin systems X is a set of spin carriers and Y contains 2s+1 z-components -s<=m<=s…

Mesoscale and Nanoscale Physics · Physics 2007-05-23 W. Florek , G. Kamieniarz , A. Caramico D'Auria , U. Esposito , F. Esposito

Discrete Diffusion and Flow Matching models have significantly advanced generative modeling for discrete structures, including graphs. However, the dependencies between intermediate noisy states lead to error accumulation and propagation…

Machine Learning · Computer Science 2025-06-24 Yoann Boget

A progress report on two recent theoretical approaches proposed to understand the physics of irreversible fractal aggregates showing up a structural transition from a rather dense to a more multibranched growth is presented. In the first…

Condensed Matter · Physics 2008-08-31 E. Canessa

We improve on the description of the relationship that exists between critical clusters in thermal systems and intermittency near the onset of chaos in low-dimensional systems. We make use of the statistical-mechanical language of…

Statistical Mechanics · Physics 2017-10-06 M. Riquelme-Galvan , A. Robledo

In this document, we aim to gather various results related to a compositional/categorical approach to rigorous Statistical Mechanics. Rigorous Statistical Mechanics is centered on the mathematical study of statistical systems. Central…

Mathematical Physics · Physics 2024-03-26 Grégoire Sergeant-Perthuis

Let $G$ be a finite abelian group and $A$ a subset of $G$. The spectrum of $A$ is the set of its large Fourier coefficients. Known combinatorial results on the structure of spectrum, such as Chang's theorem, become trivial in the regime…

Combinatorics · Mathematics 2015-04-07 Kaave Hosseini , Shachar Lovett
‹ Prev 1 2 3 10 Next ›