Related papers: Polar degrees and closest points in codimension tw…
Let $G$ be a group, $\mathcal{P}_G$ be the family of all subsets of $G$. For a subset $A\subseteq G$, we put $\Delta(A)=\{g\in G:|gA\cap A|=\infty\}$. The mapping $\Delta:\mathcal{P}_G\rightarrow\mathcal{P}_G$, $A\mapsto\Delta(A)$, is…
The purpose of this article is to show how one might compute the \'etale cohomology groups $H^p_{\acute{e}t}(X,G_m)$ in degrees $p=0$, $1$ and $2$ of a toric variety $X$ with coefficients in the sheaf of units. The method is to reduce the…
The problem of finding the distance from a given $n \times n$ matrix polynomial of degree $k$ to the set of matrix polynomials having the elementary divisor $(\lambda-\lambda_0)^j, \, j \geqslant r,$ for a fixed scalar $\lambda_0$ and $2…
It has long been known that to a complex cubic surface or threefold one can canonically associate a principally polarized abelian variety. We give a construction which works for cubics over an arithmetic base. This answers, away from the…
We focus on various dynamical invariants associated to toric correspondences, using algebraic geometry or arithmetic. We find a formula for the dynamical degrees, relate the exponential growth of the degree sequences with a strict…
In a previous paper, we announced a formula to compute Gromov-Witten and Welschinger invariants of some toric varieties, in terms of combinatorial objects called floor diagrams. We give here detailed proofs in the tropical geometry…
We count the number of isomorphism classes of degree $d$-twists of some polarized abelian varieties over finite fields of odd prime dimension. This can be seen as a higher dimensional analogue of the counting problem for elliptic curves…
In this paper we develop a geometric approach to convex subdifferential calculus in finite dimensions with employing some ideas of modern variational analysis. This approach allows us to obtain natural and rather easy proofs of basic…
We present two algorithms for large-scale low-rank Euclidean distance matrix completion problems, based on semidefinite optimization. Our first method works by relating cliques in the graph of the known distances to faces of the positive…
The polar decomposition for a matrix $A$ is $A=UB$, where $B$ is a positive Hermitian matrix and $U$ is unitary (or, if $A$ is not square, an isometry). This paper shows that the ability to apply a Hamiltonian $\pmatrix{ 0 & A^\dagger \cr A…
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…
This text presents several aspects of the theory of equisingularity of complex analytic spaces from the standpoint of Whitney conditions. The goal is to describe from the geometrical, topological, and algebraic viewpoints a canonical…
Pairwise Euclidean distance calculation is a fundamental step in many machine learning and data analysis algorithms. In real-world applications, however, these distances are frequently distorted by heteroskedastic noise$\unicode{x2014}$a…
This is a computational study of bottlenecks on algebraic varieties. The bottlenecks of a smooth variety $X \subseteq \mathbb{C}^n$ are the lines in $\mathbb{C}^n$ which are normal to $X$ at two distinct points. The main result is a…
Euclidean distance matrices corresponding to an arithmetic progression have rich spectral and structural properties. We exploit those properties to develop completely positive factorizations of translations of those matrices. We show that…
There is a well-known class of algebras called Igusa-Todorov algebras which were introduced in relation to finitistic dimension conjecture. As a generalization of Igusa-Todorov algebras, the new notion of $(m,n)$-Igusa-Todorov algebras…
We introduce and study the Bourbaki degree as a numerical invariant for \(2 \times 4\) matrices $\Theta$ of homogeneous polynomials over a polynomial ring \(R = k[x_1, \dots, x_n]\). This invariant, defined via a Bourbaki sequence for the…
An effective method of computing division polynomials in terms of Mumford coordinates is presented. As an example, division polynomials for $3$- and $4$-torsion divisors on a genus two curve are obtained explicitly in terms of Mumford…
Classical (maximal) superintegrable systems in $n$ dimensions are Hamiltonian systems with $2n-1$ independent constants of the motion, globally defined, the maximum number possible. They are very special because they can be solved…
In both real and complex cases, we establish the connection of the problem about $2$-dimensional linear subspaces the most deviating from the coordinate ones with one simply formulated optimization problem for isoperimetric polygons in…