We discuss, in a non-Archimedean setting, the distribution of the coefficients of L-polynomials of curves of genus g over $\mathbb{F}_q$. Among other results, this allows us to prove that the $\mathbb{Q}$-vector space spanned by such characteristic polynomials has dimension g + 1. We also state a conjecture about the Archimedean distribution of the number of rational points of curves over finite fields.

In the last two decades the study of random instances of constraint satisfaction problems (CSPs) has flourished across several disciplines, including computer science, mathematics and physics. The diversity of the developed methods, on the rigorous and non-rigorous side, has led to major advances regarding both the theoretical as well as the applied viewpoints. Based on a ceteris paribus approach in terms of the density evolution equations known from statistical physics, we focus on a specific prominent class of regular CSPs, the so-called occupation problems, and in particular on $r$-in-$k$ occupation problems. By now, out of these CSPs only the satisfiability threshold – the largest degree for which the problem admits asymptotically a solution – for the $1$-in-$k$ occupation problem has been rigorously established. Here we determine the satisfiability threshold of the $2$-in-$k$ occupation problem for all $k$. In the proof we exploit the connection of an associated optimization problem regarding the overlap of satisfying assignments to a fixed point problem inspired by belief propagation, a message passing algorithm developed for solving such CSPs.

We consider the hard-core model on a finite square grid graph with stochastic Glauber dynamics parametrized by the inverse temperature $\beta$. We investigate how the transition between its two maximum-occupancy configurations takes place in the low-temperature regime $\beta \to \infty$ in the case of periodic boundary conditions. The hard-core constraints and the grid symmetry make the structure of the critical configurations for this transition, also known as essential saddles, very rich and complex. We provide a comprehensive geometrical characterization of these configurations that together constitute a bottleneck for the Glauber dynamics in the low-temperature limit. In particular, we develop a novel isoperimetric inequality for hard-core configurations with a fixed number of particles and show how the essential saddles are characterized not only by the number of particles but also their geometry.

We give a criterion for separability of subgroups of certain outer automorphism groups. This answers questions of Hagen and Sisto, by strengthening and generalizing a result of theirs on mapping class groups.

Let $\mathbb{N}$ be the set of all non-negative integers. For any integer r and m, let $r+m\mathbb{N}=\{r+mk: k\in\mathbb{N}\}$. For $S\subseteq \mathbb{N}$ and $n\in \mathbb{N}$, let $R_{S}(n)$ denote the number of solutions of the equation $n=s+s'$ with $s, s'\in S$ and $s \lt s'$. Let $r_{1}, r_{2}, m$ be integers with $0 \lt r_{1} \lt r_{2} \lt m$ and $2\mid r_{1}$. In this paper, we prove that there exist two sets C and D with $C\cup D=\mathbb{N}$ and $C\cap D=(r_{1}+m\mathbb{N})\cup (r_{2}+m\mathbb{N})$ such that $R_{C}(n)=R_{D}(n)$ for all $n\in\mathbb{N}$ if and only if there exists a positive integer l such that $r_{1}=2^{2l+1}-2, r_{2}=2^{2l+1}-1, m=2^{2l+2}-2$.

Let Γ be a finite graph and let $A(\Gamma)$ be the corresponding right-angled Artin group. From an arbitrary basis $\mathcal B$ of $H^1(A(\Gamma),\mathbb F)$ over an arbitrary field, we construct a natural graph $\Gamma_{\mathcal B}$ from the cup product, called the cohomology basis graph. We show that $\Gamma_{\mathcal B}$ always contains Γ as a subgraph. This provides an effective way to reconstruct the defining graph Γ from the cohomology of $A(\Gamma)$, to characterize the planarity of the defining graph from the algebra of $A(\Gamma)$ and to recover many other natural graph-theoretic invariants. We also investigate the behaviour of the cohomology basis graph under passage to elementary subminors and show that it is not well-behaved under edge contraction.

Recently, it is proven that positive harmonic functions defined in the unit disc or the upper half-plane in $\mathbb{C}$ are contractions in hyperbolic metrics [14]. Furthermore, the same result does not hold in higher dimensions as shown by given counterexamples [16]. In this paper, we shall show that positive (or bounded) harmonic functions defined in the unit ball in $\mathbb{R}^{n}$ are Lipschitz in hyperbolic metrics. The involved method in main results allows to establish essential improvements of Schwarz type inequalities for monogenic functions in Clifford analysis [24, 25] and octonionic analysis [21] in a unified approach.

In this paper, we show that for a large natural class of vertex operator algebras (VOAs) and their modules, the Zhu’s algebras and bimodules (and their g-twisted analogs) are Noetherian. These carry important information about the representation theory of the VOA, and its fusion rules, and the Noetherian property gives the potential for (non-commutative) algebro-geometric methods to be employed in their study.

The delta invariant interprets the criterion for the K-(poly)stability of log terminal Fano varieties. In this paper, we determine local delta invariants for all weak del Pezzo surfaces with the anti-canonical degree $\geq 5$.

We prove a large deviation principle for the slow-fast rough differential equations (RDEs) under the controlled rough path (RP) framework. The driver RPs are lifted from the mixed fractional Brownian motion (FBM) with Hurst parameter $H\in (1/3,1/2)$. Our approach is based on the continuity of the solution mapping and the variational framework for mixed FBM. By utilizing the variational representation, our problem is transformed into a qualitative property of the controlled system. In particular, the fast RDE coincides with Itô stochastic differential equation (SDE) almost surely, which possesses a unique invariant probability measure with frozen slow component. We then demonstrate the weak convergence of the controlled slow component by averaging with respect to the invariant measure of the fast equation and exploiting the continuity of the solution mapping.

This work is concerned with the exponential turnpike property for optimal control problems of particle systems and their mean-field limit. Under the assumption of the strict dissipativity of the cost function, exponential estimates for both optimal states and optimal control are proven. Moreover, we show that all the results for particle systems can be preserved under the limit in the case of infinitely many particles.

For a given graph $H$, we say that a graph $G$ has a perfect $H$-subdivision tiling if $G$ contains a collection of vertex-disjoint subdivisions of $H$ covering all vertices of $G.$ Let $\delta _{\mathrm {sub}}(n, H)$ be the smallest integer $k$ such that any $n$-vertex graph $G$ with minimum degree at least $k$ has a perfect $H$-subdivision tiling. For every graph $H$, we asymptotically determined the value of $\delta _{\mathrm {sub}}(n, H)$. More precisely, for every graph $H$ with at least one edge, there is an integer $\mathrm {hcf}_{\xi }(H)$ and a constant $1 \lt \xi ^*(H)\leq 2$ that can be explicitly determined by structural properties of $H$ such that $\delta _{\mathrm {sub}}(n, H) = \left (1 - \frac {1}{\xi ^*(H)} + o(1) \right )n$ holds for all $n$ and $H$ unless $\mathrm {hcf}_{\xi }(H) = 2$ and $n$ is odd. When $\mathrm {hcf}_{\xi }(H) = 2$ and $n$ is odd, then we show that $\delta _{\mathrm {sub}}(n, H) = \left (\frac {1}{2} + o(1) \right )n$.

We give a complete combinatorial classification of the parabolic Verma modules in the principal block of the parabolic category $\mathcal{O}$ associated with a minimal or a maximal parabolic subalgebra of the special linear Lie algebra for which the answer to Kostant’s problem is positive.

Recently it has been shown that the unique local perimeter minimizing partitioning of the plane into three regions, where one region has finite area and the other two have infinite measure, is given by the so-called standard lens partition. Here we prove a sharp stability inequality for the standard lens, hence strengthening the local minimality of the lens partition in a quantitative form. As an application of this stability result we consider a nonlocal perturbation of an isoperimetric problem.

Motivated by the study of algebraic classes in mixed characteristic, we define a countable subalgebra of ${\overline {\mathbb {Q}}}_p$ which we call the algebra of André’s p-adic periods. The classical Tannakian formalism cannot be used to study these new periods. Instead, inspired by ideas of Drinfel’d on the Plücker embedding and further developed by Haines, we produce an adapted Tannakian setting which allows us to bound the transcendence degree of André’s p-adic periods and to formulate the p-adic analog of the Grothendieck period conjecture. We exhibit several examples where special values of classical p-adic functions appear as André’s p-adic periods, and we relate these new conjectures to some classical problems on algebraic classes.

The notion of a strongly dense subgroup was introduced by Breuillard, Green, Guralnick and Tao: a subgroup Γ of a semi-simple $\mathbb{Q}$ algebraic group $\mathcal{G}$ is called strongly dense if every pair of non-commuting elements generate a Zariski dense subgroup. Amongst other things, Breuillard et al. prove that there exist strongly dense free subgroups in $\mathcal{G}({\mathbb{R}})$ and ask whether or not a Zariski dense subgroup of $\mathcal{G}(\mathbb{R})$ always contains a strongly dense free subgroup. In this paper, we answer this for many surface subgroups of $\textrm{SL}(3,\mathbb{R})$.

We propose and unify classes of different models for information propagation over graphs. In a first class, propagation is modelled as a wave, which emanates from a set of known nodes at an initial time, to all other unknown nodes at later times with an ordering determined by the arrival time of the information wave front. A second class of models is based on the notion of a travel time along paths between nodes. The time of information propagation from an initial known set of nodes to a node is defined as the minimum of a generalised travel time over subsets of all admissible paths. A final class is given by imposing a local equation of an eikonal form at each unknown node, with boundary conditions at the known nodes. The solution value of the local equation at a node is coupled to those of neighbouring nodes with lower values. We provide precise formulations of the model classes and prove equivalences between them. Finally, we apply the front propagation models on graphs to semi-supervised learning via label propagation and information propagation on trust networks.