Related papers: Varieties Connected by Chains of Lines

Clique-width is a well-studied graph parameter. For graphs of bounded clique-width, many problems that are NP-hard in general can be polynomial-time solvable. The fact motivates several studies to investigate whether the clique-width of…

We present an algebraic study of line correspondences for pinhole cameras, in contrast to the thoroughly studied point correspondences. We define the line multiview variety as the Zariski closure of the image of the map projecting lines in…

We study the problem of classifying the irreducible projective varieties $X$ of dimension $n\ge 2$ in $\Bbb P^N$ which contain an algebraic family $\Cal F$ of dimension $h+1$ ($h<n$) of subvarieties $Y$ of dimension $n-h$, each one…

We show that a line arrangement in the complex projective plane supports a nontrivial resonance variety if and only if it is the underlying arrangement of a "multinet," a multi-arrangement with a partition into three or more equinumerous…

We give a new, systematic proof for a recent result of Larry Guth and thus also extend the result to a setting with several families of varieties: For any integer $D\geq 1$ and any collection of sets $\Gamma_1,\ldots,\Gamma_j$ of low-degree…

In Part I of this paper we introduced the notion of the projective linking number Link(M,Z) of a compact oriented real submanifold M of dimension 2p-1 in complex projective n-space P^n with an algebraic subvariety Z of codimension p in P^n…

Let $P$ be a set of $n$ points in general position in the plane. Let $R$ be a set of $n$ points disjoint from $P$ such that for every $x,y \in P$ the line through $x$ and $y$ contains a point in $R$ outside of the segment delimited by $x$…

We introduce "chain by chain" method for constructing the constraint structure of a system possessing both first and second class constraints. We show that the whole constraints can be classified into completely irreducible first or second…

We establish a criterion for a complex number to be algebraic over Q of degree at most two. It requires that, for any sufficiently large real number X, there exists a non-zero polynomial with integral coefficients, of degree at most two and…

Labelled Markov chains (LMCs) are widely used in probabilistic verification, speech recognition, computational biology, and many other fields. Checking two LMCs for equivalence is a classical problem subject to extensive studies, while the…

We show that for any knot there exist only finitely many irreducible metabelian characters in the $SL(2,\mathbb{C})$-character variety of the knot group, and the number is given explicitly by using the determinant of the knot. Then it turns…

We give a proof for sharp estimate for the number of spanning trees using linear algebra and generalize this bound to multigraphs. In addition, we show that this bound is tight for complete graphs. In addition, we give estimates for number…

Let $P$ be a set of $m$ points and $L$ a set of $n$ lines in $\mathbb R^4$, such that the points of $P$ lie on an algebraic three-dimensional surface of degree $D$ that does not contain hyperplane or quadric components, and no 2-flat…

We generalize the Guth--Katz joints theorem from lines to varieties. A special case says that $N$ planes (2-flats) in 6 dimensions (over any field) have $O(N^{3/2})$ joints, where a joint is a point contained in a triple of these planes not…

We prove that the Jones diameter of a link is twice its crossing number whenever the breadth of its Jones polynomial equals the difference between the crossing number and the Turaev genus. This implies that such link is adequate, as per the…

Great part of the interest in complex networks has been motivated by the presence of structured, frequently non-uniform, connectivity. Because diverse connectivity patterns tend to result in distinct network dynamics, and also because they…

Given $n$ pairwise disjoint sets $X_1,\ldots, X_n$, we call the elements of $S=X_1\times\ldots\times X_n$ strings. A nonempty set of strings $W\subseteq S$ is said to be well-connected if for every $v\in W$ and for every $i\, (1\le i\le…

Sets in R^n in which every pair of elements x, y can be connected by a path in the set of length bounded by a constant multiple of the distance between x and y are considered.

Patterns on numerical semigroups are multivariate linear polynomials, and they are said to be admissible if there exists a numerical semigroup such that evaluated at any nonincreasing sequence of elements of the semigroup gives integers…

Invariants for complicated objects such as those arising in phylogenetics, whether they are invariants as matrices, polynomials, or other mathematical structures, are important tools for distinguishing and working with such objects. In this…