Related papers: Some spherical codes in S2 and their algebraic num…
Numerical integrations in celestial mechanics often involve the repeated computation of a rotation with a constant angle. A direct evaluation of these rotations yields a linear drift of the distance to the origin. This is due to roundoff in…
A spherical two-distance set is a finite collection of unit vectors in $\reals^n$ such that the set of distances between any two distinct vectors has cardinality two. We use the semidefinite programming method to compute improved estimates…
Clemm and Trebat-Leder (2014) proved that the number of quadratic number fields with absolute discriminant bounded by $x$ over which there exist elliptic curves with good reduction everywhere and rational $j$-invariant is $\gg…
We present a new algorithm to decompose generic spinor polynomials into linear factors. Spinor polynomials are certain polynomials with coefficients in the geometric algebra of dimension three that parametrize rational conformal motions.…
A perfect cuboid is a rectangular parallelepiped with integer edges, integer face diagonals, and integer space diagonal. Such cuboids have not yet been found, but nor has their existence been disproved. Perfect cuboids are described by a…
We consider polynomials of a few linear forms and show how exploit this type of sparsity for optimization on some particular domains like the Euclidean sphere or a polytope. Moreover, a simple procedure allows to detect this form of…
Cyclic codes are a subclass of linear codes and have wide applications in data storage systems, communication systems and consumer electronics due to their efficient encoding and decoding algorithms. Let $\alpha $ be a generator of…
We compute the integer cohomology rings of the ``polygon spaces'' introduced in [Hausmann,Klyachko,Kapovich-Millson]. This is done by embedding them in certain toric varieties; the restriction map on cohomology is surjective and we…
Several problems in computer algebra can be efficiently solved by reducing them to calculations over finite fields. In this paper, we describe an algorithm for the reconstruction of multivariate polynomials and rational functions from their…
The polygon retrieval problem on points is the problem of preprocessing a set of $n$ points on the plane, so that given a polygon query, the subset of points lying inside it can be reported efficiently. It is of great interest in areas such…
We introduce fractional integrals on the $n$-dimensional spherical cap, study their boundednes in weighted $L^p$ spaces and obtain explicit inversion formulas. The results are applied to the inversion problem for Riesz potentials on a…
The sphere $S^2$ and the torus $T^2$ are the only closed connected surfaces for which higher topological complexities are known (for each $n\in\{2,3,...\}\subset\mathbb{N}$, $\mathrm{TC}_n(S^2)=n$ and $\mathrm{TC}_n(T^2)=2n-2$). This text…
We analyze polarization-adjusted convolutional codes using the algebraic representation of polar and Reed-Muller codes. We define a large class of codes, called generalized polynomial polar codes which include PAC codes and Reverse PAC…
We study the topological complexity, in the sense of Smale, of three enumerative problems in algebraic geometry: finding the 27 lines on cubic surfaces, the 28 bitangents and the 24 inflection points on quartic curves. In particular, we…
A small polygon is a convex polygon of unit diameter. We are interested in small polygons which have the largest area for a given number of vertices $n$. Many instances are already solved in the literature, namely for all odd $n$, and for…
Many problems of systems control theory boil down to solving polynomial equations, polynomial inequalities or polyomial differential equations. Recent advances in convex optimization and real algebraic geometry can be combined to generate…
We consider a polynomial reconstruction of smooth functions from their noisy values at discrete nodes on the unit sphere by a variant of the regularized least-squares method of An et al., SIAM J. Numer. Anal. 50 (2012), 1513--1534. As nodes…
We consider the notions of (i) critical points, (ii) second-order points, (iii) local minima, and (iv) strict local minima for multivariate polynomials. For each type of point, and as a function of the degree of the polynomial, we study the…
Given a symbolic power of a homogeneous ideal in a polynomial ring, we study the problem of determining which powers of the ideal contain it. For ideals defining 0-dimensional subschemes of projective space, as an immediate corollary of our…
The Stackelberg prediction game (SPG) is popular in characterizing strategic interactions between a learner and an attacker. As an important special case, the SPG with least squares loss (SPG-LS) has recently received much research…