Related papers: Limit linear series: combinatorial theory
In a recent work, we introduced a parametric framework for obtaining obstruction characterizations of graph parameters with respect to a quasi-ordering $\leqslant$ on graphs. Towards this, we proposed the concepts of class obstruction,…
In this work, we develop a spectral theory for hypergraph limits. We prove the convergence of the spectra of adjacency and Laplacian matrices for hypergraph sequences converging in the $1$-cut metric. On the other hand, we give examples of…
Ryser's max term rank formula with graph theoretic terminology is equivalent to a characterization of degree sequences of simple bipartite graphs with matching number at least $\ell$. In a previous paper by the authors, a generalization was…
We show that several classes of ordered structures (namely, convex linear orders, layered permutations, and compositions) admit first-order logical limit laws.
We survey recent developments on rationality problems for algebraic varieties, with a particular emphasis on cycle-theoretic and combinatorial methods and their applications to hypersurfaces.
Motivated by some recent developments in abstract theories of quadratic forms, we start to develop in this work an expansion of Linear Algebra to multivalued structures (a multialgebraic structure is essentially an algebraic structure but…
We study the integral and measure theory of the ultraproduct of finite sets. As a main application we construct limit objects for hypergraph sequences. We give a new proof for the Hypergraph Removal Lemma and the Hypergraph Regularity…
Determining the maximum number of edges in an intersecting hypergraph on a fixed ground set under additional constraints is one of the central topics in extremal combinatorics. In contrast, there are few results on analogous problems…
The purpose of this article is to investigate triangularization and simultaneous triangularization of matrices over max algebras using graph theoretic methods. We establish a connection between commutators and commutants with simultaneous…
We introduce a notion of limit linear series for nodal curves which are not of compact type. We give a construction of a moduli space of limit linear series, which works also in smoothing families, and we prove a corresponding…
Connection matrices for graph parameters with values in a field have been introduced by M. Freedman, L. Lov{\'a}sz and A. Schrijver (2007). Graph parameters with connection matrices of finite rank can be computed in polynomial time on graph…
We formulate and analyze several finiteness conjectures for linear algebraic groups over higher-dimensional fields. In fact, we prove all of these conjectures for algebraic tori as well as in some other situations. This work relies in an…
We enumerate the connected graphs that contain a number of edges growing linearly with respect to the number of vertices. So far, only the first term of the asymptotics and a bound on the error were known. Using analytic combinatorics, ie…
In this talk we introduce several topics in combinatorial number theory which are related to groups; the topics include combinatorial aspects of covers of groups by cosets, and also restricted sumsets and zero-sum problems on abelian…
It is discussed how a limiting procedure of (super)conformal field theories may result in logarithmic (super)conformal field theories. The construction is illustrated by logarithmic limits of (unitary) minimal models in conformal field…
We investigate, using purely combinatorial methods, structural and algorithmic properties of linear equivalence classes of divisors on tropical curves. In particular, an elementary proof of the Riemann-Roch theorem for tropical curves,…
An intense activity is nowadays devoted to the definition of models capturing the properties of complex networks. Among the most promising approaches, it has been proposed to model these graphs via their clique incidence bipartite graphs.…
In this paper we formulate and prove a combinatorial version of the section conjecture for finite groups acting on finite graphs. We apply this result to the study of rational points and show that finite descent is the only obstruction to…
We study the collection of group structures that can be realized as a group of rational points on an elliptic curve over a finite field (such groups are well known to be of rank at most two). We also study various subsets of this collection…
We present a complete computational classification of the combinatorial types of hyperplane sections, or slices, of the regular cube up to dimension six. For each dimension, we determine the exact number of distinct combinatorial types.…