Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Optimality of spherical codes via exact semidefinite programming bounds
We show that the spectral embeddings of all known triangle-free strongly regular graphs are
optimal spherical codes (the new cases are $56 $ points in $20 $ dimensions, $50 $ points …
optimal spherical codes (the new cases are $56 $ points in $20 $ dimensions, $50 $ points …
Optimality and uniqueness of the root system
We prove that the $ D_4 $ root system (the set of vertices of the regular $24 $-cell) is the
unique optimal kissing configuration in $\mathbb R^ 4$, and is an optimal spherical code …
unique optimal kissing configuration in $\mathbb R^ 4$, and is an optimal spherical code …
Solving clustered low-rank semidefinite programs arising from polynomial optimization
We study a primal-dual interior point method specialized to clustered low-rank semidefinite
programs requiring high precision numerics, which arise from certain multivariate …
programs requiring high precision numerics, which arise from certain multivariate …
The Lasserre hierarchy for equiangular lines with a fixed angle
We compute the second and third levels of the Lasserre hierarchy for the spherical finite
distance problem. A connection is used between invariants in representations of the …
distance problem. A connection is used between invariants in representations of the …
Optimal measures for multivariate geometric potentials
We study measures and point configurations optimizing energies based on multivariate
potentials. The emphasis is put on potentials defined by geometric characteristics of sets of …
potentials. The emphasis is put on potentials defined by geometric characteristics of sets of …
Dual certificates and efficient rational sum-of-squares decompositions for polynomial optimization over compact sets
We study the problem of computing weighted sum-of-squares (WSOS) certificates for
positive polynomials over a compact semialgebraic set. Building on the theory of interior …
positive polynomials over a compact semialgebraic set. Building on the theory of interior …
Verifying feasibility of degenerate semidefinite programs
This paper deals with the algorithmic aspects of solving feasibility problems of semidefinite
programming (SDP), aka linear matrix inequalities (LMI). Since in some SDP instances all …
programming (SDP), aka linear matrix inequalities (LMI). Since in some SDP instances all …
The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices
In the study of monostatic polyhedra, initiated by John H. Conway in 1966, the main question
is to construct such an object with the minimal number of faces and vertices. By …
is to construct such an object with the minimal number of faces and vertices. By …
Additive and Multiplicative Coinvariant Spaces of Weyl Groups in the Light of Harmonics and Graded Transfer
A finite group with an integral representation has two induced canonical actions, one on
polynomials and one on Laurent polynomials. Knowledge about the invariants is in either …
polynomials and one on Laurent polynomials. Knowledge about the invariants is in either …
Optimization of trigonometric polynomials with crystallographic symmetry and spectral bounds for set avoiding graphs
We provide a new approach to the optimization of trigonometric polynomials with
crystallographic symmetry. This approach widens the bridge between trigonometric and …
crystallographic symmetry. This approach widens the bridge between trigonometric and …