相关论文: Generalized rescaling limits of a sequence of rati…

We establish the scaling limit of the geodesics to the root for the first passage percolation distance on random planar maps. We first describe the scaling limit of the number of faces along the geodesics. This result enables us to compare…

Consider a rational map $R$ of degree $d\geq 2$ with coefficients over the non-archimedean field $\mathbb{C}_p$, with $p$ a fixed prime number. If $R$ has a cycle of Siegel disks and has good reduction, then it was shown by Rivera-Letelier…

Cayley's formula states that the number of labelled trees on $n$ vertices is $n^{n-2}$, and many of the current proofs involve complex structures or rigorous computation. We present a bijective proof of the formula by providing an…

Let $K$ be a number field and $S$ a fixed finite set of places of $K$ containing all the archimedean ones. Let $R_S$ be the ring of $S$-integers of $K$. In the present paper we study the cycles for rational maps of $\mathbb{P}_1(K)$ of…

We propose a numerical method based on the master field for large-$N$ reduced matrix models. While the master field is originally an infinite-dimensional matrix, in this method it is regularized to a finite dimension, with the requirement…

Let $W$ be a $G$-graded algebra over a field of characteristic zero, where $G$ is a finite group. We develope a theory of generalized $G$-graded polynomial identities satisfied by any finite-dimensional $W$-algebra $A$, by mean of the…

We study the ``approximate squaring'' map f(x) := x ceiling(x) and its behavior when iterated. We conjecture that if f is repeatedly applied to a rational number r = l/d > 1 then eventually an integer will be reached. We prove this when…

We define an extension of parity from the integers to the rational numbers. Three parity classes are found -- even, odd and `none'. Using the 2-adic valuation, we partition the rationals into subgroups with a rich algebraic structure. The…

If dividing by $p$ is a mistake, multiply by $q$ and translate, and so you'll live to iterate. We show that if we define a Collatz-like map in this form then, under suitable conditions on $p$ and $q$, almost all orbits of this map attain…

We consider scalar field theory in the D-dimensional space with nontrivial metric and local action functional of most general form. It is possible to construct for this model a generalization of renormalization procedure and RG-equations.…

We give evidence that the functional renormalization group (FRG), developed to study disordered systems, may provide a field theoretic description for the loop-erased random walk (LERW), allowing to compute its fractal dimension in a…

Limits of graphs were initiated recently in the two extreme contexts of dense and bounded degree graphs. This led to elegant limiting structures called graphons and graphings. These approach have been unified and generalized by authors in a…

We present a simple yet rigorous approach to the determination of the spectral dimension of random trees, based on the study of the massless limit of the Gaussian model on such trees. As a byproduct, we obtain evidence in favor of a new…

We start out by demonstrating that an elementary learning task, corresponding to the training of a single linear neuron in a convolutional neural network, can be solved for feature spaces of very high dimensionality. In a second step,…

Length generalization is a key property of a learning algorithm that enables it to make correct predictions on inputs of any length, given finite training data. To provide such a guarantee, one needs to be able to compute a length…

We study the scaling limits of looptrees associated with Bienaym\'e--Galton--Watson (BGW) trees, that are obtained by replacing every vertex of the tree by a "cycle" whose size is its degree. First, we consider BGW trees whose offspring…

We address the fundamental question of why deep neural networks generalize by establishing a pointwise generalization theory for fully connected networks. This framework resolves long-standing barriers to characterizing the rich nonlinear…

Let $X,Y$ be two irreducible subvarieties of the projective space $\mathbb{P}^n$, and $d\geq 1$ an integer number. The main result of this paper is an algorithm to construct {\bf explicitly}, in terms of $d$ and the ideals defining $X$ and…

A linear forest is a collection of vertex-disjoint paths. The Linear Arboricity Conjecture states that every graph of maximum degree $\Delta$ can be decomposed into at most $\lceil(\Delta+1)/2\rceil$ linear forests. We prove that $\Delta/2…

We review the techniques used to renormalize quantum field theories at several loop orders. This includes the techniques to systematically extract the infinities in a Feynman integral and the implementation of the algorithm within computer…