Related papers: The Hrushovski-Lang-Weil estimates

In this paper we provide a full account of the Weil conjectures including Deligne's proof of the conjecture about the eigenvalues of the Frobenius endomorphism. Section 1 is an introduction into the subject. Our exposition heavily relies on…

Some results of B. Pasynkov and H. Torunczyk on finite-dimensional maps are improved. A generalization of a Dranishnikov-Uspenskij theorem about extensional dimension is also obtained.

Various equivariant intersection numbers on Hilbert schemes of points on the affine plane are computed, some of which are organized into tau-functions of 2-Toda hierarchies. A correspondence between the equivariant intersection on Hilbert…

In this paper we present a concrete counterexample to the conjecture of Kontsevich about the polynomial countability of graph hypersurfaces. In contrast to this, we show that the "wheel with spokes" graphs $WS_n$ are polynomially countable.

We present a proof of the Chevalley-Weil Theorem that is somewhat different from the proofs appearing in the literature and with somewhat weaker hypotheses, of purely topological type. We also provide a discussion of the assumptions, and an…

We prove Russo-Seymour-Welsh type crossing estimates for the FK-Ising model on general s-embeddings whose origami map has an asymptotic Lipschitz constant strictly smaller than $1$, provided a mild non-degeneracy assumption is satisfied.…

Conway and Gordon proved that for every spatial complete graph on six vertices, the sum of the linking numbers over all of the constituent two-component links is odd, and Kazakov and Korablev proved that for every spatial complete graph…

Based on various strategies and a new general doubling operator, we obtain several simple proofs of the celebrated Sharkovsky's cycle coexistence theorem. A simple non-directed graph proof which is especially suitable for a calculus course…

A $k$-uniform hypergraph is $s$-almost intersecting if every edge is disjoint from exactly $s$ other edges. Gerbner, Lemons, Palmer, Patk\'os and Sz\'ecsi conjectured that for every $k$, and $s>s_0(k)$, every $k$-uniform $s$-almost…

We give a combinatorial rule for computing intersection numbers on a flag manifold which come from products of Schubert classes pulled back from Grassmannian projections. This rule generalizes the known rule for Grassmannians.

Hurwitz numbers with completed cycles are standard Hurwitz numbers with simple branch points replaced by completed cycles. In fact, simple branch points correspond to completed $2$-cycles. Okounkov and Pandharipande have established the…

We consider generalizations of Szpiro's classical discriminant conjecture to hyperelliptic curves over a number field $K$, and to smooth, projective and geometrically connected curves $X$ over $K$ of genus at least one. The main results…

We prove a weighted Sobolev estimate of the Bergman projection on the Hartogs triangle, where the weight is some power of the distance to the singularity at the boundary. This method also applies to the $n$-dimensional generalization of the…

We describe a direct connection between the representation theory of the general linear group and classical Schubert calculus on the Grassmannian, which goes via the Chern-Weil theory of characteristic classes. We also explain why the…

We investigate the possibility of proving upper bounds on Hadwiger's number of a graph with partial information, mirroring several known upper bounds for the chromatic number. For each such bound we determine whether the corresponding bound…

We prove that the Frobenius structure constructed from the Gromov-Witten theory for an orbifold projective line with at most $r$ orbifold points is uniquely determined by the WDVV equations with certain natural initial conditions.

We say that a metric graph is uniformly bounded if the degrees of all vertices are uniformly bounded and the lengths of edges are pinched between two positive constants; a metric space is approximable by a uniform graph if there is one…

The existence of universal unfoldings of certain germs of meromorphic connections is established. This is used to prove a general construction theorem for Frobenius manifolds. A particular case is Dubrovin's theorem on semisimple Frobenius…

The 1-2-3 Conjecture, posed in 2004 by Karonski, Luczak, and Thomason, is as follows: "If G is a graph with no connected component having exactly 2 vertices, then the edges of G may be assigned weights from the set {1,2,3} so that, for any…

This work discusses the Alon-Tarsi number of line graphs and total graphs. In addition, we also discuss the Alon-Tarsi number of some Erdos-Faber-Lovasz (EFL) graphs.