相关论文: An algorithm for the classification of smooth Fano…
We construct a family of root-finding algorithms which exploit the branched covering structure of a polynomial of degree $d$ with a path-lifting algorithm for finding individual roots. In particular, the family includes an algorithm that…
A well known result by Lagarias and Ziegler states that there are finitely many equivalence classes of d-dimensional lattice polytopes having volume at most K, for fixed constants d and K. We describe an algorithm for the complete…
An inductive approach to classifying toric Fano varieties is given. As an application of this technique, we present a classification of the toric Fano threefolds with at worst canonical singularities. Up to isomorphism, there are 674,688…
In this paper we study smooth, complex Fano 4-folds X with large Picard number rho(X), with techniques from birational geometry. Our main result is that if X is isomorphic in codimension one to the blow-up of a smooth projective 4-fold Y at…
Gorenstein Fano polytopes arising from finite partially ordered sets will be introduced. Then we study the problem which partially ordered sets yield smooth Fano polytopes.
The positive semidefinite (psd) rank of a polytope is the size of the smallest psd cone that admits an affine slice that projects linearly onto the polytope. The psd rank of a d-polytope is at least d+1, and when equality holds we say that…
Let $X$ be a complex smooth Fano variety of dimension at least four. In this paper, we classify such $X$ when the pseudoindex is at least $n-2$ and the Picard number greater than one. We also discuss the relations between pseudoindex and…
The symmetric edge polytopes of odd cycles (del Pezzo polytopes) are known as smooth Fano polytopes. In this paper, we show that if the length of the cycle is 127, then the Ehrhart polynomial has a root whose real part is greater than the…
We classify Q-Fano threefolds of Fano index > 2 and big degree.
Smooth Fano polytopes (SFP) play an important role in toric geometry and combinatorics. In this paper, we introduce a specific subcollection of them, i.e., the unimodular smooth Fano polytopes (USFP). In Section 2, they are verified to…
We provide a complete classification up to isomorphism of all smooth convex lattice 3-polytopes with at most 16 lattice points. There exist in total 103 different polytopes meeting these criteria. Of these, 99 are strict Cayley polytopes…
We compute the rational homotopy groups of the classifying space $\mathrm{BDiff}_{\partial}(S^1 \times D^{d-1})$ of the topological group of diffeomorphisms of $S^1 \times D^{d-1}$ fixing the boundary for $d \geq 6$, in a range of degrees…
We determine the numbers of integral tetrahedra with diameter $d$ up to isomorphism for all $d\le 1000$ via computer enumeration. Therefore we give an algorithm that enumerates the integral tetrahedra with diameter at most $d$ in $O(d^5)$…
A smooth variety is said to satisfy Condition (A) if every finite abelian subgroup of its automorphism group has a fixed point. We classify smooth Fano 3-folds that satisfy Condition (A).
By identifying K-polystable limits in 4 specific deformations families of smooth Fano 3-folds, we complete the classification of one-dimensional components in the K-moduli space of smoothable Fano 3-folds.
We use tropical geometry to compute the multidegree and Newton polytope of the hypersurface of a statistical model with two hidden and four observed binary random variables, solving an open question stated by Drton, Sturmfels and Sullivant…
We describe an algorithm to enumerate polytopes. This algorithm is then implemented to give a complete classification of combinatorial spheres of dimension 3 with 9 vertices and decide polytopality of those spheres. In particular, we…
The correspondence between Gorenstein Fano toric varieties and reflexive polytopes has been generalized by Ilten and S\"u{\ss} to a correspondence between Gorenstein Fano complexity-one $T$-varieties and Fano divisorial polytopes. Motivated…
Context: The huge and still rapidly growing amount of galaxies in modern sky surveys raises the need of an automated and objective classification method. Unsupervised learning algorithms are of particular interest, since they discover…
We consider a natural generalization of an abelian Hidden Subgroup Problem where the subgroups and their cosets correspond to graphs of linear functions over a finite field F with d elements. The hidden functions of the generalized problem…