Related papers: Eine Bemerkung zu einem Satz von E. Becker und D. …
We show that the decision problem of determining whether a given (abstract simplicial) $k$-complex has a geometric embedding in $\mathbb R^d$ is complete for the Existential Theory of the Reals for all $d\geq 3$ and $k\in\{d-1,d\}$. This…
In 2015, G.~Mikhalkin introduced a refined count for real rational curves in toric surfaces. The counted curves have to pass through some real and complex points located on the toric boundary of the surface, and the count is refined…
We count the number of countable homogeneous colored linear orderings in $k$ colors. Relatedly, we count the number of countable $C_{n,m}$-homogeneous linear orderings. $C_{n,m}$-homogeneity is a strong homogeneity notion that approximates…
The classical Steinitz theorem asserts that if the origin lies within the interior of the convex hull of a set $S \subset \mathbb{R}^d$, then there are at most $2d$ points in $S$ whose convex hull contains the origin within its interior.…
Here is an example of a plane set of vanishing area and consisting of line-segments whose directions cover an angle : let E be a Cantor set of dissection ratio 1/4 (therefore dimension 1/2) carried by the horizontal axis and E' the image of…
We establish that every set of $k=10$ natural numbers determines at least $30$ distinct pairwise sums or at least $30$ distinct pairwise products, as well as the analogous result for $k=11$ and at least $34$ sums/products, with sharpness…
We study the stratification of the space of monic polynomials with real coefficients according to the number and multiplicities of real zeros. In the first part, for each of these strata we provide a purely combinatorial chain complex…
We present two new canonical forms for real congruence of a real square matrix $A$. The first one is a direct sum of canonical matrices of four different types and is obtained from the canonical form under $^*$congruence of complex matrices…
``Real Normed Algebras Revisited,'' the last paper of the late Gadi Moran, attempts to reconstruct the discovery of the complex numbers, the quaternions and the octonions, as well as proofs of their properties, using only what was known to…
Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and…
Suppose that $nk$ points in general position in the plane are colored red and blue, with at least $n$ points of each color. We show that then there exist $n$ pairwise disjoint convex sets, each of them containing $k$ of the points, and each…
We classify the irreducible components of the Hilbert scheme of $n$ points on non-reduced algebraic plane curves, and give a formula for the multiplicities of the irreducible components. The irreducible components are indexed by partitions…
Computing the real solutions to a system of polynomial equations is a challenging problem, particularly verifying that all solutions have been computed. We describe an approach that combines numerical algebraic geometry and sums of squares…
In this revised form, the proof of the principal lemma has been simplified and the main theorem has been extended to all characteristics for those varieties which are smooth in codimension one. This principal theorem essentially says the…
We refine the bit complexity analysis of an algorithm for the computation of at least one point per connected component of a smooth real algebraic set, yielding exponential speedup (with respect to the number of variables) compared to prior…
Let $\mathrm{R}$ be a real closed field. We prove that the number of semi-algebraically connected components of a real hypersurface in $\mathrm{R}^n$ defined by a multi-affine polynomial of degree $d$ is bounded by $2^{d-1}$. This bound is…
Recent work of Kass--Wickelgren gives an enriched count of the $27$ lines on a smooth cubic surface over arbitrary fields. Their approach using $\mathbb{A}^1$-enumerative geometry suggests that other classical enumerative problems should…
We prove a constant term conjecture of Robbins and Zeilberger (J. Combin. Theory Ser. A 66 (1994), 17-27), by translating the problem into a determinant evaluation problem and evaluating the determinant. This determinant generalizes the…
Even though weight multiplicity formulas, such as Kostant's formula, exist their computational use is extremely cumbersome. In fact, even in cases when the multiplicity is well understood, the number of terms considered in Kostant's formula…
In physics, Lie groups represent the algebraic structure that describes symmetry transformations of a given system. Then, the descending Lie algebra of those groups are necessarily real. In most cases, the complexification of those Lie…