Related papers: A wall crossing formula for degrees of real centra…
We analyze the threshold network model in which a pair of vertices with random weights are connected by an edge when the summation of the weights exceeds a threshold. We prove some convergence theorems and central limit theorems on the…
We give an upper bound for the degree of rational curves in a family that covers a given birational ruled surface in projective space. The upper bound is stated in terms of the degree, sectional genus and arithmetic genus of the surface. We…
We present a novel algorithm for deciding whether a given planar curve is an image of a given spatial curve, obtained by a central or a parallel projection with unknown parameters. The motivation comes from the problem of establishing a…
We study the degree distribution of a randomly chosen vertex in a duplication--divergence graph, under a variety of different generalizations of the basic model of Bhan, Galas and Dewey (2002) and V\'azquez, Flammini, Maritan and Vespignani…
We prove a theorem on distortion of cross ratio of four points under the mapping effected by a complex polynomial with restricted critical values. Its corollaries include inequalities involving the absolute value and certain coefficients of…
The computational complexity of some depths that satisfy the projection property, such as the halfspace depth or the projection depth, is known to be high, especially for data of higher dimensionality. In such scenarios, the exact depth is…
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…
Wall-crossing phenomena are ubiquitous in many problems of algebraic geometry and theoretical physics. Various ways to encode the relevant information and the need to track the changes under the variation of parameters lead to rather…
We present a novel algorithm for deciding whether a given planar curve is an image of a given spatial curve, obtained by a central or a parallel projection with unknown parameters. A straightforward approach to this problem consists of…
The Chisini conjecture asserts that a generic ramified covering over the complex projective plane of degree at least 5 is uniquely determined by its branch curve. We prove this for degree at least 12 using the work of Kulikov…
We consider how the problem of determining normal forms for a specific class of nonholonomic systems leads to various interesting and concrete bridges between two apparently unrelated themes. Various ideas that traditionally pertain to the…
We prove that for a dominant rational self-map $f$ on a quasi-projective variety defined over $\overline{\mathbb{Q}}$, there is a point whose $f$-orbit is well-defined and its arithmetic degree is arbitrarily close to the first dynamical…
A random geometric digraph $G_n$ is constructed by taking $\{X_1,X_2,... X_n\}$ in $\mathbb{R}^2$ independently at random with a common bounded density function. Each vertex $X_i$ is assigned at random a sector $S_i$ of central angle…
We study $c$-crossing-critical graphs, which are the minimal graphs that require at least $c$ edge-crossings when drawn in the plane. For every fixed pair of integers with $c\ge 13$ and $d\ge 1$, we give first explicit constructions of…
We show that the WZW fusion rings at finite levels form a projective system with respect to the partial ordering provided by divisibility of the height, i.e. the level shifted by a constant. From this projective system we obtain WZW fusion…
This paper shows that the multiplicity of the base points locus of a projective rational surface parametrization can be expressed as the degree of the content of a univariate resultant. As a consequence, we get a new proof of the degree…
Using elementary number theory, we prove several results about the complexity of CR mappings between spheres. It is known that CR mappings between spheres, invariant under finite groups, lead to sharp bounds for degree estimates on real…
Alternating projections and their variants are classical tools for computing points in intersections of sets. Existing analyses for smooth manifolds mainly focus on local convergence rates under transversality or related regularity…
Consider non-intersecting Brownian motions on the real line, starting from the origin at t=0, with a number of particles forced to reach p distinct target points at time t=1. This work shows that the transition probability, that is the…
Given two arbitrary closed sets in Euclidean space, a simple transversality condition guarantees that the method of alternating projections converges locally, at linear rate, to a point in the intersection. Exact projection onto nonconvex…