Related papers: Computing Severi Degrees with Long-edge Graphs
In approximation theory classical discrete operators, like generalized sampling, Sz\'{a}sz-Mirak'jan, Baskakov and Bernstein operators, have been extensively studied for scalar functions. In this paper, we look at the approximation of…
In this article we give an explicit construction of the moduli space of trigonal superelliptic curves with level 3 structure. The construction is given in terms of point sets on the projective line and leads to a closed formula for the…
Links in $S^3$ as well as Legendrian links in the standard tight contact structure on $S^3$ can be encoded by grid diagrams. These consist of a collection of points on a toroidal grid, connected by vertical and horizontal edges. Blackwell,…
We consider the task of drawing a graph on multiple horizontal layers, where each node is assigned a layer, and each edge connects nodes of different layers. Known algorithms determine the orders of nodes on each layer to minimize crossings…
This article studies the sequence of iterative degrees of a birational map of the plane. This sequence is known either to be bounded or to have a linear, quadratic or exponential growth. The classification elements of infinite order with a…
For a positive integer $k\ge 1$, a graph $G$ is $k$-stepwise irregular ($k$-SI graph) if the degrees of every pair of adjacent vertices differ by exactly $k$. Such graphs are necessarily bipartite. Using graph products it is demonstrated…
We study the problem of generating graphs with prescribed degree sequences for bipartite, directed, and undirected networks. We first propose a sequential method for bipartite graph generation and establish a necessary and sufficient…
In 2010, Joyce et. al defined the leverage centrality of vertices in a graph as a means to analyze functional connections within the human brain. In this metric a degree of a vertex is compared to the degrees of all it neighbors. We…
We make a systematic study of the focal surface of a congruence of lines in the projective space. Using differential techniques together with techniques from intersection theory, we reobtain in particular all the invariants of the focal…
This Note gives conditions that must be imposed to algebraic multilevel discretizations involving at the same time nodal and edge elements so that a gradient-prolongation commutativity condition will be satisfied; this condition is very…
It is known for linear operators with polynomial coefficients annihilating a given D-finite function that there is a trade-off between order and degree. Raising the order may give room for lowering the degree. The relationship between order…
This paper surveys some recent results and progress on the extremal prob- lems in a given set consisting of all simple connected graphs with the same graphic degree sequence. In particular, we study and characterize the extremal graphs…
We study a family of closely-related distributed graph problems, which we call degree splitting, where roughly speaking the objective is to partition (or orient) the edges such that each node's degree is split almost uniformly. Our findings…
It has long been known that to a complex cubic surface or threefold one can canonically associate a principally polarized abelian variety. We give a construction which works for cubics over an arithmetic base. This answers, away from the…
The degree of a projective subscheme has an upper bound in term of the codimension and the reduction number. If a projective variety has an almost maximal degree, that is, the degree equals to the upper bound minus one, then its Betti table…
In a previous paper, we announced a formula to compute Gromov-Witten and Welschinger invariants of some toric varieties, in terms of combinatorial objects called floor diagrams. We give here detailed proofs in the tropical geometry…
The Sierpi\'nski product of graphs generalises the vast and relevant class of Sierpi\'nski-type graphs, and is also related to the classic lexicographic product of graphs. Our first main results are necessary and sufficient conditions for…
We prove a formula for the polar degree of projective hypersurfaces in terms of the Milnor data of the singularities, extending to 1-dimensional singularities the Dimca-Papadima result for isolated singularities. We discuss the…
Intuitively speaking, a bipartite graph is mirror if it can be drawn in the Cartesian plane in such a way that, the vertices of one stable are points in x=0, the vertices of the other stable set are points in x=1, the edges are straight…
We study the degree landscape of the partition graph $G_n$, whose vertices are the integer partitions of $n$ and whose edges correspond to elementary transfers of one unit between parts, followed by reordering. Using the previously…