English
Related papers

Related papers: Sequences of enumerative geometry: congruences and…

200 papers

We consider random temporal graphs, a version of the classical Erd\H{o}s--R\'enyi random graph G(n,p) where additionally, each edge has a distinct random time stamp, and connectivity is constrained to sequences of edges with increasing time…

Probability · Mathematics 2023-06-21 Nicolas Broutin , Nina Kamčev , Gabor Lugosi

Let t[n] be a sequence that satisfies a first order homogeneous recurrence t[n] = Q[n]*t[n-1], where Q is a polynomial with integer coefficients. The asymptotic behavior of the p-adic valuation of t[n] is described under the assumption that…

Number Theory · Mathematics 2007-09-17 T. Amdeberhan , L. Medina , Victor H. Moll

Let $(C,p_1,\ldots,p_n)$ be a fixed general pointed curve and let $(X,x_1,\ldots,x_n)$ be a smooth hypersurface of degree $e$ and dimension $r$ with $n$ general points. We consider the problem of enumerating maps $f:C\to X$ of degree $d$…

Algebraic Geometry · Mathematics 2023-02-03 Carl Lian

We answer some enumerative questions about irreducible rational curves on Hirzebruch surfaces, by combining an idea of Kontsevich with the study of the geometry of certain natural parameter spaces. Our formulas generalize Kontsevich's…

alg-geom · Mathematics 2008-02-03 Lucia Caporaso , Joe Harris

We consider the set of all graphs on n labeled vertices with prescribed degrees D=(d_1, ..., d_n). For a wide class of tame degree sequences D we prove a computationally efficient asymptotic formula approximating the number of graphs within…

Combinatorics · Mathematics 2011-12-05 Alexander Barvinok , J. A. Hartigan

We show the Kontsevich space of rational curves of degree at most roughly $\frac{2-\sqrt{2}}{2}n$ on a general hypersurface $X\subset \mathbb{P}^n$ of degree $n-1$ is equidimensional of expected dimension and has two components: one…

Algebraic Geometry · Mathematics 2019-02-01 Dennis Tseng

We study the number of representations of an integer n=F(x_1,...,x_s) by a homogeneous form in sufficiently many variables. This is a classical problem in number theory to which the circle method has been succesfully applied to give an…

Number Theory · Mathematics 2014-11-21 Damaris Schindler

In characteristic $p>0$ and for $q$ a power of $p$, we compute the number of nonplanar rational curves of arbitrary degrees on a smooth Hermitian surface of degree $q+1$ under the assumption that the curves have a parametrization given by…

Algebraic Geometry · Mathematics 2020-03-31 Norifumi Ojiro

Symplectic invariants introduced in math-ph/0702045 can be computed for an arbitrary spectral curve. For some examples of spectral curves, those invariants can solve loop equations of matrix integrals, and many problems of enumerative…

Mathematical Physics · Physics 2009-11-30 Bertrand Eynard , Nicolas Orantin

We introduce a systematic approach to express generating functions for the enumeration of maps on surfaces of high genus in terms of a single generating function relevant to planar surfaces. Central to this work is the comparison of two…

Mathematical Physics · Physics 2023-02-07 Nicholas Ercolani , Joceline Lega , Brandon Tippings

Let $\text{PG}(n,q)$ be the Desarguesian projective space of dimension $n$ over the finite field of order $q$. The \emph{linear representation} of a point set $\mathcal{K}$ in a hyperplane at infinity of $\text{PG}(n,q)$ is the point-line…

Combinatorics · Mathematics 2021-12-24 Lins Denaux

We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number g_n of unlabeled outerplanar graphs on n vertices can be computed in polynomial time, and g_n is asymptotically $g n^{-5/2}\rho^{-n}$, where…

Combinatorics · Mathematics 2007-05-23 Manuel Bodirsky , Eric Fusy , Mihyun Kang , Stefan Vigerske

For any fixed integer $R \geq 2$ we characterise the typical structure of undirected graphs with vertices $1, ..., n$ and maximum degree $R$, as $n$ tends to infinity. The information is used to prove that such graphs satisfy a labelled…

Combinatorics · Mathematics 2012-12-18 Vera Koponen

Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…

Discrete Mathematics · Computer Science 2008-06-20 Tsiriniaina Andriamampianina

We derive an asymptotic formula for the number of connected 3-uniform hypergraphs with vertex set $[N]$ and $M$ edges for $M=N/2+R$ as long as $R$ satisfies $R = o(N)$ and $R=\omega(N^{1/3}\ln^{2} N)$. This almost completely fills the gap…

Combinatorics · Mathematics 2014-01-30 Cristiane M. Sato , Nick Wormald

We investigate the asymptotic number of equivalence classes of linear codes with prescribed length and dimension. While the total number of inequivalent codes of a given length has been studied previously, the case where the dimension…

Information Theory · Computer Science 2025-10-17 Andrea Di Giusto , Alberto Ravagnani

We pose thirty conjectures on arithmetical sequences, most of which are about monotonicity of sequences of the form $(\root n\of{a_n})_{n\ge 1}$ or the form $(\root{n+1}\of{a_{n+1}}/\root n\of{a_n})_{n\ge1}$, where $(a_n)_{n\ge 1}$ is a…

Combinatorics · Mathematics 2013-11-01 Zhi-Wei Sun

We explain connections among several, a priori unrelated, areas of mathematics: combinatorics, algebraic statistics, topology and enumerative algebraic geometry. Our focus is on discrete invariants, strongly related to the theory of…

Algebraic Geometry · Mathematics 2022-09-30 Mateusz Michałek

We study the geometry of an important class of generic curves in the Grassmannian manifolds of $n$-dimensional subspaces and Lagrangian subspaces of $R^{2n}$ under the action of the linear and linear symplectic group.

Symplectic Geometry · Mathematics 2011-09-21 Juan Carlos Álvarez Paiva , Carlos E. Durán

In this paper we obtain new effective results on the Halpern iterations of nonexpansive mappings using methods from mathematical logic or, more specifically, proof-theoretic techniques. We give effective rates of asymptotic regularity for…

Functional Analysis · Mathematics 2007-10-10 Laurentiu Leustean
‹ Prev 1 3 4 5 6 7 10 Next ›