Related papers: Limit linear series: combinatorial theory

We prove a general multi-dimensional central limit theorem for the expected number of vertices of a given degree in the family of planar maps whose vertex degrees are restricted to an arbitrary (finite or infinite) set of positive integers…

The major challenge in designing a discriminative learning algorithm for predicting structured data is to address the computational issues arising from the exponential size of the output space. Existing algorithms make different assumptions…

Let $G$ be a relatively hyperbolic group that admits a decomposition into a finite graph of relatively hyperbolic groups structure with quasi-isometrically (qi) embedded condition. We prove that the set of conjugates of all the vertex and…

Ordered, linear, and other substructural type systems allow us to expose deep properties of programs at the syntactic level of types. In this paper, we develop a family of unary logical relations that allow us to prove consequences of…

We present an expository overview of the monoidal structures in the category of linearly compact vector spaces. Bimonoids in this category are the natural duals of infinite-dimensional bialgebras. We classify the relations on words whose…

The restricted hypercube-like graphs, variants of the hypercube, were proposed as desired interconnection networks of parallel systems. The matching preclusion number of a graph is the minimum number of edges whose deletion results in the…

Selectional restrictions are semantic constraints on forming certain complex types in natural language. The paper gives an overview of modeling selectional restrictions in a relational type system with morphological and syntactic types. We…

In this article we introduce a definition of k-uniform thresholds hypergraphs through a binary sequence, a natural extension of the classical definition for thresholds graphs. We characterize some of its eigenvalues and multiplicities by…

We define some new sequences of recursively constructed random combinatorial trees, and show that, after properly rescaling graph distance and equipping the trees with the uniform measure on vertices, each sequence converges almost surely…

We prove a version of Clifford's theorem for metrized complexes. Namely, a metrized complex that carries a divisor of degree $2r$ and rank $r$ (for $0<r<g-1$) also carries a divisor of degree $2$ and rank $1$. We provide a structure theorem…

Building on our earlier results on tropical independence and shapes of divisors in tropical linear series, we give a tropical proof of the maximal rank conjecture for quadrics. We also prove a tropical analogue of Max Noether's theorem on…

In the present article we describe a class of algebraic curves on which rational functions of two arguments may reach all their possible limiting values. We also solve a similar question for functions that can be represented as a uniform…

We give a combinatorial description of shape theory using finite topological $T_0$-spaces (finite partially ordered sets). This description may lead to a sort of computational shape theory. Then we introduce the notion of core for inverse…

A generic construction of linear codes over finite fields has recently received a lot of attention, and many one-weight, two-weight and three-weight codes with good error correcting capability have been produced with this generic approach.…

In this thesis, we study connections between metric and combinatorial graphs from a Dirichlet space point of view.

The topic of this treatise is a combinatorial technique called Graph Pebbling. We investigate pebbling numbers, weight functions, flow networks, hypercubes, and the zero-sum conjecture of Erd\H{o}s and Lemke. This investigation is a…

In this paper we study general tropical linear spaces locally: For any basis B of the matroid underlying a tropical linear space L, we define the local tropical linear space L_B to be the subcomplex of L consisting of all vectors v that…

In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of $n$ definable sets belonging to some fixed definable family of sets in an o-minimal structure. This generalizes the…

We give a classification and overview of the confining N=1 supersymmetric gauge theories. For simplicity we consider only theories based on simple gauge groups and no tree-level superpotential. Classification of these theories can be done…

The paper has a form of a survey and consists of three parts. It is focused on the relationship between the many-sorted theory, which leads to logical geometry and one-sorted theory, which is based on the important model-theoretic concepts.…