English
Related papers

Related papers: Flow Polynomials and their Asymptotic Limits for L…

200 papers

The feasible region $\Omega_{{\rm ind}}(F)$ of a graph $F$ is the collection of points $(x,y)$ in the unit square such that there exists a sequence of graphs whose edge densities approach $x$ and whose induced $F$-densities approach $y$. A…

Combinatorics · Mathematics 2022-11-15 Xizhi Liu , Dhruv Mubayi , Christian Reiher

Let \mathbb{F}_q^{n+l} denote the (n+l)-dimensional singular linear space over a finite field \mathbb{F}_q. For a fixed integer m\leq\min\{n,l\}, denote by \mathcal{L}^m_o(\mathbb{F}_q^{n+l}) the set of all subspaces of type (t,t_1), where…

Combinatorics · Mathematics 2013-09-23 Zhang Baohuan , Yue Mengtian , Li Zengti

Theoretical and numerical studies of the Wilson flow in lattice QCD suggest that the gauge field obtained at flow time t>0 is a smooth renormalized field. The expectation values of local gauge-invariant expressions in this field are thus…

High Energy Physics - Lattice · Physics 2014-01-28 Martin Lüscher

We study the connections between volume growth, spectral properties and stochastic completeness of locally finite graphs. For a class of graphs with a very weak spherical symmetry we give a condition which implies both stochastic…

Spectral Theory · Mathematics 2012-10-01 Matthias Keller , Daniel Lenz , Radoslaw K. Wojciechowski

We prove that a simple random walk on quasi-transitive graphs with the volume growth being faster than any polynomial of degree 4 has a.s. infinitely many cut times, and hence infinitely many cutpoints. This confirms a conjecture raised by…

Probability · Mathematics 2017-12-08 He Song , Kainan Xiang

We resolve the computational complexity of Graph Isomorphism for classes of graphs characterized by two forbidden induced subgraphs $H_1$ and $H_2$ for all but six pairs $(H_1,H_2)$. Schweitzer had previously shown that the number of open…

Discrete Mathematics · Computer Science 2019-09-04 Marthe Bonamy , Nicolas Bousquet , Konrad K. Dabrowski , Matthew Johnson , Daniël Paulusma , Théo Pierron

The "edge polytope" of a finite graph G is the convex hull of the columns of its vertex-edge incidence matrix. We study extremal problems for this class of polytopes. For k =2, 3, 5 we determine the maximum number of vertices of…

Combinatorics · Mathematics 2014-06-30 Tuan Tran , Günter M. Ziegler

For an integer $r$, a prime power $q$, and a polynomial $f$ over a finite field ${\mathbb F}_{q^r}$ of $q^r$ elements, we obtain an upper bound on the frequency of elements in an orbit generated by iterations of $f$ which fall in a proper…

Number Theory · Mathematics 2014-07-29 Oliver Roche-Newton , Igor Shparlinski

For a given lattice polytope $P$ in $\mathbb{R}^3$, consider the space $\mathcal{L}_P$ of trivariate polynomials over a finite field $\mathbb{F}_q$, whose Newton polytopes are contained in $P$. We give an upper bound for the maximum number…

Combinatorics · Mathematics 2022-02-01 Kyle Meyer , Ivan Soprunov , Jenya Soprunova

Let $q\geqslant 2$ be a fixed prime power. We prove an asymptotic formula for counting the number of monic polynomials that are of degree $n$ and have exactly $k$ irreducible factors over the finite field $\mathbb{F}_q$. We also compare our…

Number Theory · Mathematics 2022-09-12 Arghya Datta

In this paper, we study the asymptotic geometry of a noncollapsed ancient Ricci flow with nonnegative Ricci curvature via its tangent flow at infinity -- a noncollapsed $\mathbb{F}$-limit metric soliton [Bam23,CMZ23]. We first prove some…

Differential Geometry · Mathematics 2026-03-31 Yuxing Deng , Ganqi Wang , Yongjia Zhang

We prove a version of Tao's algebraic regularity lemma for asymptotic classes in the context of graphons. We apply it to study expander difference polynomials over fields with powers of Frobenius.

Logic · Mathematics 2022-01-04 Mirna Džamonja , Ivan Tomašić

Suppose $C \subset \mathbb{C}$ is compact. Let $q_k$ be a sequence of polynomials of degree $n_k \to \infty$, such that the locus of roots of all the polynomials is bounded, and the number of roots of $q_k$ in any closed set $L$ not meeting…

Complex Variables · Mathematics 2024-04-08 Christian Henriksen , Carsten Lunde Petersen , Eva Uhre

We observe that the Laplacian of a random graph G on N vertices represents and explicitly solvable model in the limit of infinitely increasing N. Namely, we derive recurrent relations for the limiting averaged moments of the adjacency…

Mathematical Physics · Physics 2007-05-23 A. Khorunzhy , V. Vengerovsky

Continuous normalizing flows are known to be highly expressive and flexible, which allows for easier incorporation of large symmetries and makes them a powerful computational tool for lattice field theories. Building on previous work, we…

High Energy Physics - Lattice · Physics 2025-12-22 Mathis Gerdes , Pim de Haan , Roberto Bondesan , Miranda C. N. Cheng

Many basic properties in Tutte's flow theory for unsigned graphs do not have their counterparts for signed graphs. However, signed graphs without long barbells in many ways behave like unsigned graphs from the point view of flows. In this…

Combinatorics · Mathematics 2019-09-02 You Lu , Rong Luo , Michael Schubert , Eckhard Steffen , Cun-Quan Zhang

We present a framework for modeling complex, high-dimensional distributions on convex polytopes by leveraging recent advances in discrete and continuous normalizing flows on Riemannian manifolds. We show that any full-dimensional polytope…

Machine Learning · Computer Science 2025-03-18 Tomek Diederen , Nicola Zamboni

Let $e$ be a positive integer, $p$ be an odd prime, $q=p^{e}$, and $\Bbb F_q$ be the finite field of $q$ elements. Let $f,g \in \Bbb F_q [X,Y]$. The graph $G=G_q(f,g)$ is a bipartite graph with vertex partitions $P=\Bbb F_q^3$ and $L=\Bbb…

Combinatorics · Mathematics 2015-07-21 Xiang-dong Hou , Stephen D. Lappano , Felix Lazebnik

In this work, we introduce the boundary polynomial of a graph $G$ as the ordinary generating function in two variables $B(G;x,y):= \displaystyle\sum_{S\subseteq V(G)} x^{|B(S)|}y^{|S|}$, where $B(S)$ denotes the outer boundary of $S$. We…

Combinatorics · Mathematics 2025-05-08 Walter Carballosa , Marcos Masip , Francisco A. Reyes

We give asymptotics for the level set equation for mean curvature flow on a convex domain near the point where it attains a maximum. It is known that solutions are not necessarily $C^3,$ and we recover this result and construct non-smooth…

Analysis of PDEs · Mathematics 2018-06-05 Nick Strehlke
‹ Prev 1 8 9 10 Next ›