Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

35810 · Jun 202019922001200920172026
48 results for Veronese polytopes

The study broadens the concept of cyclic polytopes to Veronese polytopes.

problem Extending the framework of cyclic polytopes to a broader class of polytopes.
method Described facial structure and combinatorial characterisation of facets via σ-parity alternating sequences.
result Established a bijective correspondence between combinatorial types of Veronese polytopes and partitions of finite sets.

The article studies factorization structures in geometry and their applications to cones and polytopes.

problem Understanding and characterizing factorization structures in geometry.
method Comprehensive study of factorization structures, including structure theory, construction of compatible polytopes and cones, and derivation of generalised Gale's evenness condition.
result Established generalised Vandermonde identities and found examples of Delzant and rational Delzant compatible polytopes.

Veronese webs are closely related to bi-Hamiltonian systems, as was shown by Gelfand and Zakharevich. Recently a correspondence between Veronese three-dimensional webs and three-dimensional Einstein-Weyl structures of hyper-CR type was established. The latter were parametrized by Dunajski and Krynski via the solutions …

2016-02-23abs ↗pdf ↗

This work is an introduction to the local geometric theory of Veronese webs developed in the last twenty years. Among the different possible approach, here one has chosen the point of view of differential forms. Moreover, in order to make its reading easier, this text is self-contained in which directly regards Verones…

2010-01-18abs ↗pdf ↗

It is shown how the well-known class of bihamiltonian structures in general position can be extended to a wider class. A generalization of the corresponding notion of a Veronese web for this wider class is presented (in the general position case Veronese webs form complete systems of local invariants for bihamiltonian …

2000-01-24abs ↗pdf ↗

Study explores warped geometries of tensor manifolds, finding non-geodesic connections for some parameters.

problem Investigate non-geodesic connections in warped Segre-Veronese manifolds.
method Investigate a one-parameter family of warped geometries, presenting closed expressions for maps and distance.
result Segre-Veronese manifolds are not geodesically connected in Euclidean geometry but can be for some warping parameters.

Veronese webs appear as the natural way of passing to the quotient of curves in the projective space. In thi paper, we give the link between classical multidimensionnal webs and veronse webs by mean of interpolation.

2004-08-18abs ↗pdf ↗

Let SVdnSV^{\pmb n}_{\pmb d} be the Segre-Veronese given as the image of the embedding induced by the line bundle OPn1××Pnr(d1,,dr)\mathcal{O}_{\mathbb{P}^{n_1}\times\dots\times\mathbb{P}^{n_r}}(d_1,\dots, d_r). We prove that asymptotically SVdnSV^{\pmb n}_{\pmb d} is not hh-defective for hn1log2(d1)h\leq n_1^{\lfloor \log_2(d-1)\rfloor}.

2016-11-05abs ↗pdf ↗

Estimates the probability of a random symmetric tensor being close to rank-one.

problem Estimating the probability of a random symmetric tensor being close to rank-one.
method Using Weyl's tube formula and techniques from Random Matrix theory, we study metric invariants of the real Veronese variety.
result Explicit formula for the reach and curvature coefficients of the real Veronese variety with respect to the Bombieri-Weyl metric.

A submanifold in a real space form attaining equality in the DDVV inequality at every point is called a Wintgen ideal submanifold. They are invariant objects under the Moebius transformations. In this paper, we classify those Wintgen ideal submanifolds of dimension m>3 which are Moebius homogeneous. There are three cla…

2014-02-14abs ↗pdf ↗

Given a 1-parameter family of 1-forms $\g(t)= \g_0+t\g_1+...+t^n\g_n$, consider the condition $d\g(t)\wedge\g(t)=0$ (of integrability for the annihilated by $\g(t)$ distribution w(t)w(t)). We prove that in order that this condition is satisfied for any tt it is sufficient that it is satisfied for N=n+3N=n+3 different value…

2002-09-20abs ↗pdf ↗

We describe some buildings related to complex Kac-Moody groups. First we describe the spherical building of SLn(C) (i.e. the projective geometry PG(Cn)) and its Veronese representation. Next we recall the construction of the affine building associated to a discrete valuation on the rational function field C(z)C(z). Then …

2001-09-19abs ↗pdf ↗

The paper studies deformation spaces of Coxeter truncation polytopes.

problem Understanding the geometric properties and deformations of Coxeter truncation polytopes.
method Analyzing Coxeter truncation polytopes and their deformation spaces.
result Description of deformation spaces for Coxeter truncation polytopes of dimension d4d \geqslant 4.

We prove that there is a correspondence between projective structures defined by torsion-free connections with skew-symmetric Ricci tensor and Veronese webs on a plane. The correspondence is used to characterise the projective structures in terms of second order ODEs.

2013-03-20abs ↗pdf ↗

Given a finite collection P of convex n-polytopes in RP^n (n>1), we consider a real projective manifold M which is obtained by gluing together the polytopes in P along their facets in such a way that the union of any two adjacent polytopes sharing a common facet is convex. We prove that the real projective structure on…

2007-05-27abs ↗pdf ↗

Given a lattice L of R^n, a polytope D is called a Delaunay polytope in L if the set of its vertices is S\cap L where S is a sphere having no lattice points in its interior. D is called perfect if the only ellipsoid in R^n that contains S\cap L is exactly S. For a vector v of the Leech lattice Λ_{24} we define Λ_{24}(v…

2009-07-04abs ↗pdf ↗

Polytopic Matrix Factorization models data as latent vectors from a polytope, maximizing determinant for identifiability.

problem Data decomposition with semi-structured latent vectors and polytope constraints.
method Model input data as latent vectors from a polytope, using determinant maximization for identifiability.
result Identifiability condition for polytopes with specific symmetry restrictions.

New methods classify hyperbolic polytopes with up to 40 facets.

problem Classifying compact hyperbolic Coxeter polytopes with specific facet counts.
method New combinatorial method via point set order types.
result Proves existence of a compact hyperbolic Coxeter 29-polytope with at least 40 facets.

Proves necessity of at least log2(n) layers to compute maximum of n numbers.

problem Computing the maximum of n numbers with ReLU neural networks.
method Uses lattice polytopes and duality with Newton polytopes to prove depth lower bounds.
result Proves that log2(n) hidden layers are necessary and sufficient.