Related papers: On Landsberg's criterion for complete intersection…
For an even set of points in the plane, choose a max-sum matching, that is, a perfect matching maximizing the sum of Euclidean distances of its edges. For each edge of the max-sum matching, consider the ellipse with foci at the edge's…
Recently, nearly complete intersection ideals were defined by Boocher and Seiner to establish lower bounds on Betti numbers for monomial ideals (arXiv:1706.09866). Stone and Miller then characterized nearly complete intersections using the…
We propose an algorithm based on Newton's method and subdivision for finding all zeros of a polynomial system in a bounded region of the plane. This algorithm can be used to find the intersections between a line and a surface, which has…
In this paper, we develop a new approach to the discrimi-nant of a complete intersection curve in the 3-dimensional projective space. By relying on the resultant theory, we first prove a new formula that allows us to define this…
We study three classes of local homomorphisms and their behavior with respect to the ascent and descent of the \emph{complete intersection} property. Crucially, they fall in between the already studied classes of complete intersection and…
Answering all questions---concerning proper holomorphic mappings between generalized Hartogs triangles---posed by Jarnicki and Plfug (First steps in several complex variables: Reinhardt domains, 2008) we characterize the existence of proper…
We consider self-similar continua possessing finite intersection property and prove intersection graph criterion for self-similar dendrites, finite order Theorem for such continua satisfying open set condition in $\mathbb{R}^n$ and…
The Hilbert polynomial of a homogeneous complete intersection is determined by the degrees of the generators of the defining ideal. The degrees of the generators are not, in general, determined by the Hilbert polynomial -- but sometimes…
The main aim of the paper is to study in greater detail absolutely homogeneous structures (that is, objects with the property that each partial isomorphism extends to a global automorphism), with special emphasis on metric spaces and…
In recent work of T. Cassidy and the author, a notion of complete intersection was defined for (non-commutative) regular skew polynomial rings, defining it using both algebraic and geometric tools, where the commutative definition is a…
In this paper, we extend the idea of comprehensive Gr\"{o}bner bases given by Weispfenning (1992) to border bases for zero dimensional parametric polynomial ideals. For this, we introduce a notion of comprehensive border bases and border…
In this paper we give a classification of complete intersection vanishing ideals on parameterized sets of clutter type over finite fields.
We solve the problem of best approximation by partial isometries of given rank to an arbitrary rectangular matrix, when the distance is measured in any unitarily invariant norm. In the case where the norm is strictly convex, we parametrize…
In this paper, we prove a criterion of elementary equivalence of stable linear groups over fields of characteristic two.
For zero-dimensional complete intersections with homogeneous ideal generators of equal degrees over an algebraically closed field of characteristic zero, we give a combinatorial proof of the smoothness of the corresponding catalecticant…
The main idea in this paper is merging two techniques that have been recently developed. On the one hand, we consider MCCGS, standing for Minimal Canonical Comprehensive Groebner Systems, a recently introduced computational tool yielding…
We prove the complete intersection theorem and complete nontrivial-intersection theorem for systems of set partitions
Tverberg's theorem is one of the cornerstones of discrete geometry. It states that, given a set $X$ of at least $(d+1)(r-1)+1$ points in $\mathbb R^d$, one can find a partition $X=X_1\cup \ldots \cup X_r$ of $X$, such that the convex hulls…
The mass transference principle, discovered by Beresnevich and Velani [Ann Math (2), 2006], is a landmark result in Diophantine approximation that allows us to obtain the Hausdorff measure theory of $\limsup$ set. Another important tool is…
We investigate edge-intersection graphs of paths in the plane grid, regarding a parameter called the bend-number. I.e., every vertex is represented by a grid path and two vertices are adjacent if and only if the two grid paths share at…