Related papers: Polar degrees and closest points in codimension tw…

Static vortices close together are studied for two different models in 2-dimen- sional Euclidean space. In a simple model for one complex field an expansion in the parameters describing the relative position of two vortices can be given in…

A Euclidean distance matrix $D(\alpha)$ is defined by $D_{ij}=(\alpha_i-\alpha_j)^2$, where $\alpha=(\alpha_1,\ldots,\alpha_n)$ is a real vector. We prove that $D(\alpha)$ cannot be written as a sum of $\left[2\sqrt{n}-2\right]$ nonnegative…

Every graph G can be embedded in a Euclidean space as a two-distance set. This allows us to reformulate the analogue of Borsuk's conjecture for two-distance sets in terms of graphs. This conjecture remains open for dimensions from 4 to 63.…

We introduce grading on certain finite dimensional simple Lie superalgebras of type $P(t)$ by elementary abelian 2-group. This grading gives rise to Pauli matrices and is a far generalization of $(\mathbb Z_2\times \mathbb Z_2)$-grading on…

Given a hypersurface in the complex projective $n$-space we prove several known formulas for the degree of its polar map by purely algebro-geometric methods. Furthermore, we give formulas for the degree of its polar map in terms of the…

In this note, we consider a complete intersection $X=\{x\in \mathbb{R}^n : f_1(x)= \ldots = f_m(x)=0\}, n>m$ and study its Euclidean distance degree in terms of the mixed volume of the Newton polytopes. We show that if the Newton polytopes…

We compute the elementary divisors of the adjacency and Laplacian matrices of families of polar graphs. These graphs have as vertices the isotropic one-dimensional subspaces of finite vector spaces with respect to non-degenerate forms, with…

A theorem is proved concerning approximation of analytic functions by multivariate polynomials in the $s$-dimensional hypercube. The geometric convergence rate is determined not by the usual notion of degree of a multivariate polynomial,…

We calculate the degree of the algebra of covariants $\mathcal{C}_d$ for binary $d$-form. Also, for the degree we obtain its integral representation and asymptotic behavior.

A manifestly Lorentz-covariant calculus based on two matrix-coordinates and their associated derivatives is introduced. It allows formulating relativistic field theories in any even-dimensional spacetime. The construction extends a…

Second-order polynomials generalize classical first-order ones in allowing for additional variables that range over functions rather than values. We are motivated by their applications in higher-order computational complexity theory,…

Metric graphs are important models for capturing the structure of complex data across various domains. While much effort has been devoted to extracting geometric and topological features from graph data, computational aspects of metric…

Let I be the toric ideal defined by a 2 x n matrix of integers, A = ((1 1 ... 1)(a_1 a_2 ... a_n)) with a_1<a_2<...<a_n. We give a combinatorial proof that I is generated by elements of degree at most the sum of the two largest differences…

A set of points $S$ in $d$-dimensional Euclidean space $\mathbb{R}^d$ is called a 2-distance set if the set of pairwise distances between the points has cardinality two. The 2-distance set is called spherical if its points lie on the unit…

A finite set of distinct vectors $\mathcal{X}$ in the $d$-dimensional Euclidean space $\mathbb{R}^d$ is called an $s$-distance set if the set of mutual distances between distinct elements of $\mathcal{X}$ has cardinality $s$. In this paper…

The analogue of polar coordinates in the Euclidean space, a polar decomposition in a metric space, if well-defined, can be very useful in dealing with integrals with respect to a sufficiently regular measure. In this note we handle the…

We give an effective procedure to explicitly find the decomposition of a polarized abelian variety into its simple factors if a period matrix is known. Since finding this datum is not easy, we also provide two methods to compute the period…

A periodic lattice in Euclidean space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…

Finding an exact maximum distance of two points in the given set is a fundamental computational problem which is solved in many applications. This paper presents a fast, simple to implement and robust algorithm for finding this maximum…

We present natural families of coordinate algebras of noncommutative products of Euclidean spaces. These coordinate algebras are quadratic ones associated with an R-matrix which is involutive and satisfies the Yang-Baxter equations. As a…