Number Theory
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Monday 23 February
We give a systematic treatment of the arithmetic BF theory, introduced by Carlson and Kim. We observe that the Cassels-Tate pairing can be naturally interpreted as an arithmetic BF functional.
Functional Analysis
Triangle inequalities for the operator symmetric modulus
We study the operator symmetric modulus (|Z|+|Z^*|)/2 for matrices Z. Several triangle type inequalities are given.
Logic
Axiomatizations of Presburger Arithmetic With Predicates For Powers
We give a complete first-order axiomatization of the structure $(\mathbb{Z},+,(\ell^{\mathbb{N}})_{\ell\in L})$, where $L \subseteq \mathbb{Z}_{\ge 2}$ is a set of pairwise multiplicatively independent integers and $\ell^{\mathbb{N}} = \{\ell^n : n\in \mathbb{N}\}$. Using recent work of Karimov et al., we obtain that this axiomatization is computable for $|L|=2$, which proves that $(\mathbb{Z},+,k^{\mathbb{N}}, \ell^{\mathbb{N}})$ is decidable for $k, \ell\in \mathbb{Z}_{\ge 2}$. Furthermore, we give an axiomatization of the universal theory of $(\mathbb{Z},+,<,(\ell^{\mathbb{N}})_{\ell\in L})$.
Read the full abstract
Rings and Algebras
A family of maximal subalgebras of the Lie algebra~$W_n(K)$
Let $K$ be an algebraically closed field of characteristic zero and ${P_n=K[x_1,\ldots,x_n]}$ the polynomial ring. Any $K$-derivation $D$ on $P_n$ is of the form ${ D=\sum_{i=1}^n f_i(x_1,\ldots,x_n)\frac{\partial}{\partial x_i} },$ where $f_i\in P_n.$ All such derivations form the Lie algebra $W_n(K)$ over the field $K$. We prove that for $s=1,\ldots,n-1$ the subalgebra $ m_s(K)=\left\{ \sum_{i=1}^s f_i\frac{\partial}{\partial x_i} +\sum_{j=s+1}^n g_j\frac{\partial}{\partial x_j} \mid f_i\in P_s,\ g_j\in P_n \right\} $ is a maximal subalgebra of~$W_n(K)$. The ideal $ I_s=\left\{\sum_{j=s+1}^n g_j\frac{\partial}{\partial x_j}\right\} $ of $m_s(K)$ is isomorphic to the Lie algebra $P_s\otimes \mathrm{Der}(K[x_{s+1},\ldots,x_n])$ and $m_s(K)/I_s\simeq W_s(K)$. The Lie algebra $W_n(K)$ is also the free module over the ring $P_n.$ Therefore, for any set $S\subseteq W_n(K)$ the rank $rk(S)$ (over $P_n$) is defined. Some properties of maximal subalgebras of rank $n$ in $W_n(K)$ are pointed out.
Read the full abstract
Functional Analysis
Involutions and angles between subspaces
Probability · Cross-listed from cs.SI
Constrained graph generation: Preserving diameter and clustering coefficient simultaneously
Generating graphs subject to strict structural constraints is a fundamental computational challenge in network science. Simultaneously preserving interacting properties-such as the diameter and the clustering coefficient- is particularly demanding. Simple constructive algorithms often fail to locate vanishingly small sets of feasible graphs, while traditional Markov-chain Monte Carlo (MCMC) samplers suffer from severe ergodicity breaking. In this paper, we propose a two-step hybrid framework combining Ant Colony Optimization (ACO) and MCMC sampling. First, we design a layered ACO heuristic to perform a guided global search, effectively locating valid graphs with prescribed diameter and clustering coefficient. Second, we use these ACO-designed graphs as structurally distinct seed states for an MCMC rewiring algorithm. We evaluate this framework across a wide range of graph edge densities and varying diameter-clustering-coefficient constraint regimes. Using the spectral distance of the normalized Laplacian to quantify structural diversity of the resulting graphs, our experiments reveal a sharp contrast between the methods. Standard MCMC samplers remain rigidly trapped in an isolated subset of feasible graphs around their initial seeds. Conversely, our hybrid ACO-MCMC approach successfully bridges disconnected configuration landscapes, generating a vastly richer and structurally diverse set of valid graphs.
Read the full abstract
Mathematical Physics
Schauder estimates for germs of distributions on smooth manifolds
We discuss germs of distributions on $d-$dimensional smooth Riemannian manifolds and, in particular, we derive multi-level Schauder estimates without making any further assumptions on the underlying geometry. As a preliminary step, we define the notions of coherence and homogeneity for germs of distributions on open subsets of $\mathbb{R}^d$, $d \ge 1$. Subsequently, we formulate both the reconstruction theorem, cf., [CZ20], and the Schauder estimates, cf., [BCZ24], in this setting. Leveraging the properties of the exponential map, we extend these results to Riemannian manifolds. Specifically, we devise a counterpart of the reconstruction theorem previously established in the literature [RS21], while additionally proving the regularity of the reconstructed distribution in suitable Hölder-Zygmund spaces. Finally, by introducing a novel concept of $\beta$-regularizing kernels on Riemannian manifolds, we establish Schauder estimates for coherent and homogeneous germs in this context.
Read the full abstract
Operator Algebras
A Banach algebra encoding quantum group duality
We introduce and study a new Banach algebra structure on the trace-zero subspace $\mathcal{T}(L^2(\mathbb{G}))_0$ of trace class operators for any locally compact quantum group $\mathbb{G}$; it is defined through a mixed Lie-type product of the two dual products on $\mathcal{T}(L^2(\mathbb{G}))$ arising from the canonical extensions of the co-products of $\mathbb{G}$ and $\widehat{\mathbb{G}}$. The surprising fact that this new product is indeed associative stems precisely from the duality of the latter two products. This, in particular, gives new faithful associative products on trace-zero matrices in $M_d(\mathbb{C})$. After establishing some basic properties, we show that the single algebra $\mathcal{T}(L^2(\mathbb{G}))_0$ captures simultaneous properties of $\mathbb{G}$ and $\widehat{\mathbb{G}}$, is faithful for a large class of quantum groups, and encodes both $M^r_{cb}(L^1(\mathbb{G}))$ and $M^r_{cb}(L^1(\widehat{\mathbb{G}}))$ as left, respectively right, completely bounded module maps on $\mathcal{T}(L^2(\mathbb{G}))$. We finish by exhibiting an analogous product on the trace-zero nuclear operators $\mathcal{N}(L^p(G))_0$ for a locally compact group $G$ and $p\in(1,\infty)$. Building on [7], our work suggests an approach for developing an $L^p$-version of locally compact quantum group theory.
Read the full abstract
Functional Analysis
Structural Properties and Normality Criteria for Subclasses of Normaloid Operators
We investigate structural properties and normality criteria for certain classes of bounded linear operators on a Hilbert space. We show that an operator $T$ with polar decomposition $T = U|T|$ is self-adjoint if and only if $T$ is absolute-$(p,r)$-paranormal and the partial isometry $U$ is self-adjoint. Extending Ando's Theorem, we prove that if $T$ is absolute-$(p,r)$-paranormal and $T^n$ is normal for some $n \in \mathbb{N}$, then $T$ itself is normal. We further show that if $T$ is absolute-$(p,r)$-paranormal and $T^2$ is compact, then $T$ is a compact normal operator. Finally, we obtain several characterizations of quasinormal partial isometries within the normaloid hierarchy.
Read the full abstract
Analysis of PDEs
Homogenization for the Poisson equation in domains perforated by random closed sets
We study the homogenization of the Poisson equation in randomly perforated domains and obtain the strange term effect in the homogenized equation. The perforations are modeled by rescaled germ-grain processes, and the main assumption is stationarity of the capacities of the holes. We emphasize that the potential in the homogenized equation is constant, despite the possibly nonstationary spatial distribution of the holes. We also establish corrector results.
Read the full abstract
Algebraic Geometry
Multigraded Hurwitz forms
The Hurwitz form of a projective variety characterizes linear spaces of complementary dimension which meet the variety non-transversally. We extend this notion to varieties in a product of projective spaces. This parallels the multigraded Chow forms due to Osserman and Trager. We study the degrees of multigraded Hurwitz forms. An explicit degree formula is given for complete intersections. This offers a new tool for elimination theory that has many applications, ranging from Nash equilibria to Feynman integrals.
Read the full abstract
Analysis of PDEs
An inverse random source problem for the fractional Helmholtz equation
This paper investigates an inverse random source problem for the stochastic fractional Helmholtz equation. The source is modeled as a centered, complex-valued, microlocally isotropic generalized Gaussian random field whose covariance and relation operators are described by classical pseudo-differential operators. For sufficiently large wavenumbers, we first establish the well-posedness of the direct problem in the distributional sense by analyzing the corresponding Lippmann–Schwinger integral equation. For the inverse problem, we show that the principal symbols of both the covariance and relation operators can be uniquely determined, with probability one, from the far-field patterns generated by a single realization of the random source. The approach employs a combination of the Born linearization, asymptotic expansions of the fractional Helmholtz Green kernel at high wavenumbers, and microlocal analysis of associated Fourier integral operators.
Read the full abstract
Functional Analysis
Wiener type theorems for countable limits of quasi-Beurling algebras and maximizing results on weights
We establish the vector-valued Wiener type theorems for countable projective and inductive limits of quasi-Banach algebras in a weighted setting for both finite and infinite dimensional cases. As an application, we extend the notions of rapidly decreasing and exponentially decreasing sequence spaces using quasi-Beurling algebras and show that they are inverse-closed; and obtain a hierarchy of inverse-closed vector-valued algebras using weights. In addition, we derive maximizing results on weights for the nonadmissible weighted version of Wiener's theorem in both discrete and continuous cases.
Read the full abstract
Analysis of PDEs
The homogeneous and inhomogeneous Dirichlet problem
We revisit the homogeneous and inhomogeneous Dirichlet problem for the Laplacian on Lipschitz domains. This is motivated by the recent postings by Amrouche and Moussaoui which purport to contradict known area integral estimates of Dahlberg and known Sobolev space estimates of Jerison and Kenig. We explain the fatal gap in the reasoning in these postings and give a self-contained proof of a special case of the results of Dahlberg. We then show that this is sufficient to disprove the central conclusions of these postings. We also provide two further proofs of the results of Dahlberg, adapted from work of Kenig and of Dahlberg-Kenig-Pipher-Verchota. Other proofs are in the original paper by Dahlberg and in work by Fabes-Mendez-Mitrea.
Read the full abstract
Probability
Sharp mixing time asymptotics of Glauber dynamics for the Curie-Weiss-Potts model at low temperatures
In this article, we derive a sharp mixing time estimate of the Glauber dynamics for the Curie-Weiss-Potts model in the low-temperature regime. In contrast to the high-temperature regime studied by Cuff et al. (J. Stat. Phys. 149: 432-477, 2012), in which the Gibbs measure is concentrated around the equiproportional distribution of spins, the Gibbs measure in the low-temperature regime is concentrated on multiple states, each with a dominant number of a single spin. Consequently, global mixing of the system requires sufficiently many transitions between these states. Since these transitions are well explained by the phenomenon of metastability, the theory of metastability plays a central role in the analysis of slow mixing. In particular, the sharp asymptotics for the mixing time is given by the mixing time of the limit Markov chain, which describes the metastable behavior of the dynamics, multiplied by the metastable transition time-scale. As a byproduct, we verify that it does not exhibit a cutoff phenomenon.
Read the full abstract
Number Theory
Congruences for traces of singular moduli and Hurwitz - Kronecker class numbers
Traces of singular moduli were introduced and studied by Zagier in 1998. Being simultaneously the (traces of) values of a modular function ($j$-invariant) and Fourier coefficients of modular forms - which constitutes Zagier's duality - these integers are quite interesting. Since then, a substantial amount of research was devoted to various properties of these numbers, congruences in particular. We present an alternative point of view on these congruences, specifically, we view them as congruences between certain weight $3/2$ modular forms under repeated action of $U$-operator. That allows us to obtain a general result which includes some previously known results as special cases. Our approach is especially effective when the prime modulus is relatively small. In these cases, we obtain explanations for certain numerical observations and quantification of some previously known qualitative results. As an application, we obtain modulo $11$ congruences between the traces of singular moduli and class numbers of quadratic fields in the case when the twisted central special value of the $L$-function associated with the elliptic curve of conductor $11$ vanishes.
Read the full abstract
Differential Geometry
High codimension mean curvature flow of spacelike-convex submanifolds with one spacelike codimension
In the pseudo-Euclidean space $\mathbb{R}^{n+1,k}$, we consider the mean curvature flow of $n$-dimensional spacelike submanifolds with spacelike codimension one and arbitrary timelike codimension $k$. We show that if the initial submanifold is compact and spacelike-convex (the acceleration along every geodesic is strictly spacelike), then natural quantities measuring curvature pinching and noncollapsing are preserved under the flow. Moreover, we prove an analogue of the Huisken and Gage-Hamilton theorems in this setting, which states that the mean curvature flow deforms any such submanifold to a point in finite time, and that the solution is asymptotic to a shrinking sphere in a maximally spacelike affine subspace $\mathbb{R}^{n+1,0}\subset \mathbb{R}^{n+1,k}$.
Read the full abstract
Rings and Algebras · Cross-listed from cs.LG
Grokking Finite-Dimensional Algebra
This paper investigates the grokking phenomenon, which refers to the sudden transition from a long memorization to generalization observed during neural networks training, in the context of learning multiplication in finite-dimensional algebras (FDA). While prior work on grokking has focused mainly on group operations, we extend the analysis to more general algebraic structures, including non-associative, non-commutative, and non-unital algebras. We show that learning group operations is a special case of learning FDA, and that learning multiplication in FDA amounts to learning a bilinear product specified by the algebra's structure tensor. For algebras over the reals, we connect the learning problem to matrix factorization with an implicit low-rank bias, and for algebras over finite fields, we show that grokking emerges naturally as models must learn discrete representations of algebraic elements. This leads us to experimentally investigate the following core questions: (i) how do algebraic properties such as commutativity, associativity, and unitality influence both the emergence and timing of grokking, (ii) how structural properties of the structure tensor of the FDA, such as sparsity and rank, influence generalization, and (iii) to what extent generalization correlates with the model learning latent embeddings aligned with the algebra's representation. Our work provides a unified framework for grokking across algebraic structures and new insights into how mathematical structure governs neural network generalization dynamics.
Read the full abstract
Group Theory
Two Characterizations of Geometrically Infinite Actions on Gromov Hyperbolic Spaces
We provide two new characterizations of geometrically infinite actions on Gromov hyperbolic spaces: one in terms of the existence of escaping geodesics, and the other via the presence of uncountably many non-conical limit points. These results extend corresponding theorems of Bonahon, Bishop, and Kapovich–Liu from the settings of Kleinian groups and pinched negatively curved manifolds to discrete groups acting properly on proper Gromov hyperbolic spaces.
Read the full abstract
Geometric Topology
Intrinsic linking of a simplicial $n$-complex embedded in $\mathbb{R}^{2n}$
We demonstrate the existence of minimal simplicial $n$-complexes which inevitably contain a nonsplittable two-component link formed by an $(n-1)$-sphere and an $n$-sphere in any embedding into $\mathbb{R}^{2n}$. This provides a higher-dimensional generalization of graphs that are not non-separating planar.
Read the full abstract
Optimization and Control · Cross-listed from cs.LG
Less is More: Convergence Benefits of Fewer Data Weight Updates over Longer Horizon
Data mixing–the strategic reweighting of training domains–is a critical component in training robust machine learning models. This problem is naturally formulated as a bilevel optimization task, where the outer loop optimizes domain weights to minimize validation loss, and the inner loop optimizes model parameters to minimize the weighted training loss. Classical bilevel optimization relies on hypergradients, which theoretically require the inner optimization to reach convergence. However, due to computational constraints, state-of-the-art methods use a finite, often small, number of inner update steps before updating the weights. The theoretical implications of this approximation are not well understood. In this work, we rigorously analyze the convergence behavior of data mixing with a finite number of inner steps $T$. We prove that the "greedy" practical approach of using $T=1$ can fail even in a simple quadratic example. Under a fixed parameter update budget $N$ and assuming the per-domain losses are strongly convex, we show that the optimal $T$ scales as $\Theta(\log N)$ (resp., $\Theta({(N \log N)}^{1/2})$) for the data mixing problem with access to full (resp., stochastic) gradients. We complement our theoretical results with proof-of-concept experiments.
Read the full abstract
Representation Theory
On factorization of matrix of Kazhdan-Lusztig polynomials
Let $\mathcal{H} = \mathcal{H}(W,S)$ be the Hecke algebra of the Coxeter system $(W,S)$ over $\mathbb{Z}[q^{\pm1}]$, where $W$ is the Weyl group of a symmetrizable Kac-Moody algebra. In this paper, we show that the matrix of Kazhdan-Lusztig polynomials of $\mathcal{H}$ factorizes into a product of $|S|$ many matrices, each of which has entries as polynomials in $q$ with nonnegative coefficients. To achieve this goal, we use hybrid basis $TC^J$ for $J\subseteq S$ of $\mathcal{H}$, defined by Grojnowski-Haiman. The intermediate matrices in the aforementioned factorization turn out to be the transition matrices from $TC^J$-basis to $TC^I$-basis for $I\subset J$. Equivalently, these coefficients can be computed using a natural restriction map from $\mathcal{H}$ to the parabolic Hecke algebra $\mathcal{H}_J$. Moreover, following the ideas from Grojnowski-Haiman, we also give a geometric proof of the positivity of these coefficients.
Read the full abstract
Probability
Stationary Log-Gamma Polymer in Half-Space
We study the half-space log-gamma polymer model with stationary initial conditions. We derive exact formulas for the distribution of the partition function along the diagonal across the entire High density phase and Low density phase. We obtain asymptotics of these distributions under the critical scaling. We also prove the first exponential upper bounds for the upper and lower tail of the scaled free energy for these half-space stationary log-gamma models.
Read the full abstract
Differential Geometry · Cross-listed from gr-qc
The Kerr two-twistor particle
An all-orders worldline effective action for Kerr black hole is achieved in twistor particle theory.
Group Theory
On automorphism group of the reduced finitary power monoid of the additive group of integers
Let $\mathbb{Z}$ be the additive group of all integers and $\mathbb{N}$ the sub-monoid of $\mathbb{Z}$ of all non-negative integers. For a finite subset $X$ of $\mathbb{Z}$, we denote by ${\rm max}\ X$ the maximum member in $X$. %Recently, Tringali and Yan (\cite{tri2}, J. Combin. Theory Ser. A, 209(2025)) proved that the only non-trivial automorphism of $\mathcal{P}_{{\rm fin,} 0}(\mathbb{N})$ %is the involution $X \mapsto \beta(X) - X$, and they posed a conjecture: {\it The automorphism group of the reduced power monoid $\mathcal{P}_{{\rm fin,} 0}(S)$ of a numerical %monoid $S$ properly contained in $\mathbb{N}$ must be the identity}. Recently, Tringali and Yan (\cite{tri2}, J. Comb. Theory, Ser. A, 209(2025)) proved that the only non-trivial automorphism of $\mathcal{P}_{{\rm fin,} 0}(\mathbb{N})$ is the involution $X \mapsto {\rm max}\ X - X$. Following up on the result in \cite{tri2}, Tringali and Wen \cite{triwen} proved that the automorphism group of the power monoid $\mathcal{P}_{\rm fin}(\mathbb{Z})$ is isomorphic to $\mathbb{Z}_2 \times {\rm Dih}_{\infty}$, where ${\rm Dih}_{\infty}$ refers to the infinite dihedral group. At the end part of \cite{triwen}, Tringali and Wen left a conjecture as follows: {\it The only non-trivial automorphism of the reduced finitary power monoid of $(\mathbb{Z},+)$ is given by $X\mapsto -X$.} In the present paper, we aim to give a positive proof for the above conjecture.
Read the full abstract
Statistics Theory
A Selection Premium Decomposition for the Expected Maximum of Random Walks
When $K$ models are evaluated on the same validation set of size $n$, the selected winner's apparent performance is biased upward. Suppose $K$ models are evaluated on a shared sequence of i.i.d. observations $X_1,\dots, X_n$, where model $k$ achieves response $f_k(X_i)$ with mean $\mu_k = \mathbb E[f_k(X)]$. Writing $Y_{i,k} = f_k(X_i)-\mu_k$ for the centered increment and $S_{n,k} = \sum_{i=1}^n Y_{i,k}$ for the centered cumulative score, the expected maximum satisfies $0\le\mathbb E\bigl[\max_k S_{n,k}\bigr] = \sum_{i=1}^n \mathbb E\bigl[\varphi_K(S_{i-1})\bigr]$ where $\varphi_K(u) = \mathbb{E}\bigl[\max_k(u_k + Y_k)\bigr] - \max_k u_k$, $u\in \mathbb R^K$, is the selection premium function. This formula corresponds to the null hypothesis case (all models are equal in the sense that they have the same mean), which clarifies that the bias arises from selection. While this decomposition follows from elementary conditioning and telescoping, we develop the analytical consequences in five directions. (i) structural properties of $\varphi_K$; (ii) extension to stopping times, recovering Wald's equation at $K=1$; (iii) a winner's curse decomposition for heterogeneous means; (iv) a universal bias concentration law showing that the first $\alpha$-fraction of observations generates a $\sqrt\alpha$-fraction of total bias.
Read the full abstract
Information Theory
Physics-Aware, Shannon-Optimal Compression via Arithmetic Coding for Distributional Fidelity
Assessing whether two datasets are distributionally consistent is central to modern scientific analysis, particularly as generative artificial intelligence produces synthetic data whose fidelity must be validated against real observations in increasingly high-dimensional settings. Existing approaches are typically relative: they determine whether one dataset is more consistent with a reference than another, but do not provide a physically grounded absolute standard for fidelity. We propose an information-theoretic approach in which lossless compression via arithmetic coding provides an operational measure of dataset fidelity under a physics-informed probabilistic representation. Datasets sharing the same underlying physical correlations admit comparable optimal descriptions, while discrepancies-arising from miscalibration, mismodeling, or bias-manifest as an irreducible excess in codelength relative to the Shannon-optimal limit defined by the physics itself. This excess codelength defines an absolute fidelity metric, quantified directly in bits. Unlike conventional measures, which lack an intrinsic scale, zero excess provides a well-defined and physically meaningful target corresponding to consistency with the underlying distribution. We show that this metric is global, interpretable, additive across components, and asymptotically optimal, with differences in codelength corresponding to differences in expected negative log-likelihood under a common reference model. As a byproduct, our approach achieves improved compression relative to standard general-purpose algorithms such as gzip. These results establish arithmetic coding not merely as a compression tool, but as a measurement instrument for absolute, physics-grounded assessment of distributional fidelity.
Read the full abstract
Statistics Theory · Cross-listed from stat.ME
The generalized underlap coefficient with an application in clustering
Quantifying distributional separation across groups is fundamental in statistical learning and scientific discovery, yet most classical discrepancy measures are tailored to two-group comparisons. We generalize the underlap coefficient (UNL), a multi-group separation measure, to multivariate settings. We study its relationship with Bayes risk and mutual information, and further interpret the UNL as a measure of dependence between group labels and variables of interest. We propose an efficient importance sampling estimator of the UNL that can be combined with flexible density estimation methods. A key application is the assessment of partition-covariate dependence in clustering, where the UNL provides an interpretable measure of whether latent group structure can be explained by specific covariates. The methodology is illustrated on two real-world datasets.
Read the full abstract
Probability
A Class of Gaussian Fields on $\mathbb{Z}_q^d$
Complex Gaussian fields $(g_x)$ on $\mathbb{Z}_q^d$ are constructed from a class of reversible long range random walks $(X_t)_{t\in \mathbb{N}}$ on $\mathbb{Z}_q^d$ in \citeauthor{GM2025a} (\citeyear{GM2025a}). The construction is from taking $\mathbb{E}\big [g_x\bar{g}_y\big ]= (1-\alpha)G(x,y;\alpha)$, where $G(x,y;\alpha)$ is the Green function of a random walk with killing in each transition at rate $1-\alpha$. Another real Gaussian field $(h^\circ_x=\Re g_x + \Im g_x)$ is constructed such that also Cov$(h^\circ_x,h^\circ_y) = (1-\alpha)G(x,y;\alpha)$. If the random walk is not reversible, then a different approach is needed because $G(x,y;\alpha)$ is not exchangeable in $x,y$. It is shown that there exists two real Gaussian fields $(h^+_x)$, $(h^-_y)$ such that Cov$(h^+_x,h^-_y) = (1-\alpha)G(x,y;\alpha)$. A decomposition of the Gaussian field $(g_x)$ into a sum of independent Gaussian random variables is made. By letting $q\to \infty$ the Gaussian field becomes defined from an infinite-dimensional random walk on a torus. The random walk model is also extended to $d=\infty$ by considering a de Finetti random walk where entries in the increments of the random walk are exchangeable. A limit Gaussian field on $\mathbb{R}^d$ arises from a central limit theorem approach. The transform of this Gaussian field, which is again a Gaussian field, is calculated. It has a simpler covariance matrix than the original field. The Hamiltonian connected to the Gaussian field is calculated. A limit theorem for the partition function arising from the Hamiltonian is found.
Read the full abstract
Combinatorics
On $r$-cross $t$-intersecting families of partitions
In this paper, we address several intersection problems for $r$-cross $t$-intersecting families of partitions. A $k$-partition of an $n$-set $X$ is a set of $k$ pairwise disjoint non-empty subsets whose union is $X$. For $1\leq i\leq r$, let $\mathcal{F}_i$ be a family of $k_i$-partitions of $X$. We say that $\mathcal{F}_1,\mathcal{F}_2,\ldots,\mathcal{F}_r$ are $r$-cross $t$-intersecting if $|\cap_{i=1}^{r}F_i|\geq t$ for all $F_i\in\mathcal{F}_i$. The families are called non-trivial if $|\cap_{i=1}^r(\cap_{F\in\mathcal{F}_i}F)|<t$. Proving an Erdős-Ko-Rado type theorem, we determine the families maximizing $\prod_{i=1}^r|\mathcal{F}_i|$. We further determine non-trivial $r$-cross $t$-intersecting families with maximum product of sizes; this result also serves as a Hilton-Milner type theorem. In particular, for $r=2$ there are two potential structures for optimal families, and for $r\geq3$ exactly one remains.