Related papers: Characteristic Numbers and invariant subvarieties …
An intuitive property of a random graph is that its subgraphs should also appear randomly distributed. We consider graphs whose subgraph densities exactly match their expected values. We call graphs with this property for all subgraphs with…
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…
"Most" hypersurfaces in projective space are irreducible, and rather precise estimates are known for the probability that a random hypersurface over a finite field is reducible. This paper considers the parametrization of space curves by…
Similarity notions between vertices in a graph, such as structural and regular equivalence, are one of the main ingredients in clustering tools in complex network science. We generalise structural and regular equivalences for undirected…
We study a class of holomorphic matrix models. The integrals are taken over middle dimensional cycles in the space of complex square matrices. As the size of the matrices tends to infinity, the distribution of eigenvalues is given by a…
We obtain the list of automorphism groups for smooth plane sextic curves over an algebraically closed field K of characteristic p=0 or p>21. Moreover, we assign to each group a geometrically complete family over K describing its…
Considering smooth mappings from input vectors to continuous targets, our goal is to characterise subspaces of the input domain, which are invariant under such mappings. Thus, we want to characterise manifolds implicitly defined by level…
This note examines the infinite divisibility of density-based transformations of normal random variables. We characterize a class of density-based transformations of normal variables which produces non-infinitely divisible distributions. We…
We constructs a new network by superposition of hexahedron , which are scale-free, highly sparse,disassortative ,and maximal planar graphs. The network degree distribution, agglomeration coefficient and degree of correlation are computed…
The use of geospatially dependent information, which has been stipulated as a law in geography, to model geographic patterns forms the cornerstone of geostatistics, and has been inherited in many data science based techniques as well, such…
For smooth projective curves the Clifford index is an important invariant which provides a bound for the dimension of the space of sections of a line bundle. This is the first step in distinguishing curves of the same genus. In this paper…
We characterize Salem numbers which have some power arising as dynamical degree of an automorphism on a complex (projective) 2-Torus, K3 or Enriques surface.
It has been shown that many networks associated with complex systems are small-world (they have both a large local clustering coefficient and a small diameter) and they are also scale-free (the degrees are distributed according to a power…
Computing cohesive subgraphs is a central problem in graph theory. While many formulations of cohesive subgraphs lead to NP-hard problems, finding a densest subgraph can be done in polynomial time. As such, the densest subgraph model has…
Given a triangulated region in the complex plane, a discrete vector field $Y$ assigns a vector $Y_i\in \mathbb{C}$ to every vertex. We call such a vector field holomorphic if it defines an infinitesimal deformation of the triangulation that…
The goal of these lectures is to explain speaker's results on uniqueness properties of spherical varieties. By a uniqueness property we mean the following. Consider some special class of spherical varieties. Define some combinatorial…
We observe that the characteristic polynomial of a linearly perturbed semidefinite matrix can be used to give the convergence rate of alternating projections for the positive semidefinite cone and a line. As a consequence, we show that such…
We define a new finite type invariant for stably homeomorphic class of curves on compact oriented surfaces without boundaries and extend to a regular homotopy invariant for spherical curves.
In this paper, we will show that the Hesselink stratification of a Hilbert scheme of hypersurfaces is independent of the choice of Pl\"ucker coordinate and there is a positive relation between the length of Hesselink's worst virtual…
We define and study structural properties of hypergraphs of models of a theory including lattice ones. Characterizations for the lattice properties of hypergraphs of models of a theory, as well as for structures on sets of isomorphism types…