相关论文: The dimensions and Euler characteristics of M. Kon…

We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm to exactly sample a random ET of the given generalized…

In this paper we obtain some explicit expressions for the Euler characteristic of a rank n coherent sheaf F on P^N and of its twists F(t) as polynomials in the Chern classes c_i(F), also giving algorithms for the computation. The employed…

Uncover the vertices of a given graph, deterministic or random, in random order; we consider both a discrete-time and a continuous-time version. We study the evolution of the number of visible edges, and show convergence after normalization…

In this paper we explore maximal deviations of large random structures from their typical behavior. We introduce a model for a high-dimensional random graph process and ask analogous questions to those of Vapnik and Chervonenkis for…

To define a minimal mathematical framework for isolating some of the characteristic properties of quantum entanglement, we introduce a generalization of the tensor product of graphs. Inspired by the notion of a density matrix, the…

The processes of constructing some graphs from others using binary operations of union with intersection (gluing) are studied. For graph classes closed with respect to gluing operations the elemental and operational bases are introduced.…

Based on results by Brugall\'e and Mikhalkin, Fomin and Mikhalkin give formulas for computing classical Severi degrees $N^{d, \delta}$ using long-edge graphs. In 2012, Block, Colley and Kennedy considered the logarithmic version of a…

A convex chain is a finite integer linear combination of indicator functions of convex polytopes. Khovanskii-Pukhlikov extend the Ehrhart theory of convex lattice polytopes to the setting of convex chains. Extending the relationship between…

Expander graphs, due to their mixing properties, are useful in many algorithms and combinatorial constructions. One can produce an expander graph with high probability by taking a random graph (e.g., the union of $d$ random bijections for a…

It is an observation of Kontsevich and Soibelman that generating series that produce certain (generalized) Donaldson Thomas invariants are secretly algebraic functions over the rationals. From a physical perspective this observation arises…

The mapping class group of a closed surface of genus $g$ is an extension of the Torelli group by the symplectic group. This leads to two natural problems: (a) compute (stably) the symplectic decomposition of the lower central series of the…

We present a new notion of limits of weighted directed graphs of growing size based on convergence of their random quotients. These limits are specified in terms of random exchangeable measures on the unit square. We call our limits…

We extend Auslander and Buchsbaum's Euler characteristic from the category of finitely generated modules of finite projective dimension to the category of modules of finite G-dimension using Avramov and Martsinkovsky's notion of relative…

In this paper we examine the percolation properties of higher-order networks that have non-trivial clustering and subgraph-based assortative mixing (the tendency of vertices to connect to other vertices based on subgraph joint degree). Our…

For non-negative integers~$k$, we consider graphs in which every vertex has exactly $k$ vertices at distance~$2$, i.e., graphs whose distance-$2$ graphs are $k$-regular. We call such graphs $k$-metamour-regular motivated by the terminology…

Modular operads are a special type of operad: in fact, they bear the same relationship to operads that graphs do to trees (i.e. simply connected graphs). One of the basic examples of a modular operad is the collection of…

We study generating series of torus integrals that contain all so-called modular graph forms relevant for massless one-loop closed-string amplitudes. By analysing the differential equation of the generating series we construct a solution…

Researchers developing implementations of distributed graph analytic algorithms require graph generators that yield graphs sharing the challenging characteristics of real-world graphs (small-world, scale-free, heavy-tailed degree…

We enumerate the independent sets of several classes of regular and almost regular graphs and compute the corresponding generating functions. We also note the relations between these graphs and other combinatorial objects and, in some…

The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes -- a purely combinatorial one and two geometric ones. It is shown, that most…