Related papers: Degree Spectra of Relations on a Cone
We introduce a class of chordal graphs called ($d_1$,$d_2$,$\dots$,$d_q$)-trees. A graph belongs to this class if and only if its clique complex is sequentially Cohen-Macaulay, providing a complete classification of all sequentially…
Consider a rational projective plane curve C parameterized by three homogeneous forms h1,h2,h3 of the same degree d in the polynomial ring R=k[x,y] over the field k. Extracting a common factor, we may harmlessly assume that the ideal…
We study the primitive recursive analogue of computable categoricity spectra for various natural classes of structures. We show that these notions coincide for all relatively $\Delta_{2}^{0}$-categorical equivalence structures and linear…
We investigate the structure of trees that have minimal algebraic connectivity among all trees with a given degree sequence. We show that such trees are caterpillars and that the vertex degrees are non-decreasing on every path on…
On an infinite, radial metric tree graph we consider the corresponding Laplacian equipped with self-adjoint vertex conditions from a large class including $\delta$- and weighted $\delta'$-couplings. Assuming the numbers of different edge…
We classify real families of minimal degree rational curves that cover an embedded rational surface. A corollary is that if the projective closure of a smooth surface is not biregular isomorphic to the projective closure of the unit-sphere,…
This paper presents an approach to the modeling of degree-degree correlation in complex networks. Thus, a simple function, \Delta(k', k), describing specific degree-to- degree correlations is considered. The function is well suited to…
Alon and Wormald showed that any graph with minimum degree d contains a spanning star forest in which every connected component is of size at least \Omega((d/\log d)^{1/3}). They asked if any connected graph with minimum degree at least d…
Despite the structural properties of online social networks have attracted much attention, the properties of the close-knit friendship structures remain an important question. Here, we mainly focus on how these mesoscale structures are…
Let $f(t, y,y')=\sum_{i=0}^d a_i(t, y)y'^i=0$ be a first order ordinary differential equation with polynomial coefficients. Eremenko in 1999 proved that there exists a constant $C$ such that every rational solution of $f(t, y,y')=0$ is of…
The complexity of equivalence relations has received much attention in the recent literature. The main tool for such endeavour is the following reducibility: given equivalence relations $R$ and $S$ on natural numbers, $R$ is computably…
We study the realizability of scale free-networks with a given degree sequence, showing that the fraction of realizable sequences undergoes two first-order transitions at the values 0 and 2 of the power-law exponent. We substantiate this…
In this paper, we prove that every graph with average degree at least $s+t+2$ has a vertex partition into two parts, such that one part has average degree at least $s$, and the other part has average degree at least $t$. This solves a…
This article is a local analysis of integrable GL(2)-structures of degree 4. A GL(2)-structure of degree n corresponds to a distribution of rational normal cones over a manifold M of dimension (n+1). Integrability corresponds to the…
We study the bi-embeddability and elementary bi-embeddability relation on graphs under Borel reducibility and investigate the degree spectra realized by this relations. We first give a Borel reduction from embeddability on graphs to…
The network topology can be described by the number of nodes and the interconnections among them. The degree of a node in a network is the number of connections it has to other nodes and the degree distribution is the probability…
We examine the convergence properties of sequences of nonnegative real numbers that satisfy a particular class of recursive inequalities, from the perspective of proof theory and computability theory. We first establish a number of results…
There are a variety of existing conditions for a degree sequence to be graphic. When a degree sequence satisfies any of these conditions, there exists a graph that realizes the sequence. We formulate several novel sufficient graphicality…
We show that the complement of a degree $d$ hypersurface in a projective complete intersection, whose defining equations have degrees strictly larger than $d$, has a rational connectivity higher than expected. The key new feature is that a…
In the study of the arithmetic degrees (the degree structure induced by relative arithmetic definability, ($\leq_{a}$) the $\omega$-REA sets play a role analogous to the role the r.e. degrees play in the study of the Turing degrees.…