English
Related papers

Related papers: An algorithm for the classification of smooth Fano…

200 papers

Let $x\ge y>0$ be integers. A positive integer is $y$-smooth if all its prime divisors are at most $y$. Let $\Psi(x,y)$ count the number of $y$-smooth integers up to $x$. We present several algorithms that will generate an integer $n\le x$…

Number Theory · Mathematics 2026-01-15 Eric Bach , Jonathan Sorenson

We construct Fano threefolds with very ample anti-canonical bundle and Picard rank greater than one from cracked polytopes - polytopes whose intersection with a complete fan forms a set of unimodular polytopes - using Laurent inversion; a…

Algebraic Geometry · Mathematics 2019-07-30 Thomas Prince

We classify smooth Fano threefolds that admit degenerations to toric Fano threefolds with ordinary double points.

Algebraic Geometry · Mathematics 2018-09-11 Sergey Galkin

We provide two families of algorithms to compute characteristic polynomials of endomorphisms and norms of isogenies of Drinfeld modules. Our algorithms work for Drinfeld modules of any rank, defined over any base curve. When the base curve…

Symbolic Computation · Computer Science 2024-11-19 Xavier Caruso , Antoine Leudière

A Howe curve is a curve of genus $4$ obtained as the fiber product over $\mathbf{P}^1$ of two elliptic curves. Any Howe curve is canonical. This paper provides an efficient algorithm to find superspecial Howe curves and that to enumerate…

Number Theory · Mathematics 2021-10-04 Momonari Kudo , Shushi Harashita

We classify the possible images of the action of the group of automorphisms of a smooth Fano threefold on its Picard group. We also study the first group cohomology of the Picard group for families of smooth Fano threefolds.

Algebraic Geometry · Mathematics 2025-11-18 Shreya Sharma

The Fast Fourier Transform (FFT) over a finite field $\mathbb{F}_q$ computes evaluations of a given polynomial of degree less than $n$ at a specifically chosen set of $n$ distinct evaluation points in $\mathbb{F}_q$. If $q$ or $q-1$ is a…

Computational Complexity · Computer Science 2023-10-24 Songsong Li , Chaoping Xing

Polytope numbers for a polytope are a sequence of nonnegative integers that are defined by the facial information of a polytope. Every polygon is triangulable and a higher dimensional analogue of this fact states that every polytope is…

Combinatorics · Mathematics 2012-06-05 H. K. Kim , J. Y. Lee

We introduce all six operations for D-cap-modules on smooth rigid analytic spaces by considering the derived category of complete bornological D-cap-modules. We then focus on a full subcategory which should be thought of as consisting of…

Algebraic Geometry · Mathematics 2025-02-04 Andreas Bode

Motivated by the need for efficient isomorphism tests for finite groups, we present a polynomial-time method for deciding isomorphism within a class of groups that is well-suited to studying local properties of general finite groups. We…

Group Theory · Mathematics 2020-11-23 Peter A. Brooksbank , Joshua Maglione , James B. Wilson

We give an explicit description of all smooth varieties with a torus action of complexity one having Picard number at most two. As a consequence, we classify in every dimension the smooth (almost) Fano varieties with a torus action of…

Algebraic Geometry · Mathematics 2025-07-08 Anne Fahrner , Juergen Hausen , Michele Nicolussi

This paper proposes a novel and simple algorithm of facet enumeration for convex polytopes. The complexity of the algorithm is discussed. The algorithm is implemented in Matlab. Some simple polytopes with known H-representations and…

Optimization and Control · Mathematics 2025-01-23 Yaguang Yang

In this paper, we study polynomial norms, i.e. norms that are the $d^{\text{th}}$ root of a degree-$d$ homogeneous polynomial $f$. We first show that a necessary and sufficient condition for $f^{1/d}$ to be a norm is for $f$ to be strictly…

Optimization and Control · Mathematics 2018-07-18 Amir Ali Ahmadi , Etienne de Klerk , Georgina Hall

Let X be a complex, Gorenstein, Q-factorial, toric Fano variety. We prove two conjectures on the maximal Picard number of X in terms of its dimension and its pseudo-index, and characterize the boundary cases. Equivalently, we determine the…

Algebraic Geometry · Mathematics 2007-05-23 C. Casagrande

In this paper we describe an algorithm for the computation of canonical forms of finite subsets of $\mathbb{Z}^d$, up to affinities over $\mathbb{Z}$. For fixed dimension $d$, this algorithm has worst-case asymptotic complexity $O(n \log^2…

Data Structures and Algorithms · Computer Science 2018-09-28 Giovanni Paolini

We establish new estimates for the number of $m$-smooth polynomials of degree $n$ over a finite field $\mathbb{F}_q$, where the main term involves the number of $m$-smooth permutations on $n$ elements. Our estimates imply that the…

Number Theory · Mathematics 2023-10-04 Ofir Gorodetsky

Smooth tropical cubic surfaces are parametrized by maximal cones in the unimodular secondary fan of the triple tetrahedron. There are $344\, 843 \,867$ such cones, organized into a database of $14\,373\,645$ symmetry classes. The Schl\"afli…

Combinatorics · Mathematics 2021-08-03 Michael Joswig , Marta Panizzut , Bernd Sturmfels

We construct some new deformation families of four-dimensional Fano manifolds of index $1$ in some known classes of Gorenstein formats. These families have explicit descriptions in terms of equations, defining their image under the…

Algebraic Geometry · Mathematics 2021-07-09 Muhammad Imran Qureshi

In Ehrhart theory, the well-known sign pattern problem asks: given a positive integer $d\geq 3$ and integers $1 \leq i_1 < \cdots < i_k \leq d-2$, does there exist a $d$-dimensional integral polytope $\mathcal{P}$ such that in its Ehrhart…

Combinatorics · Mathematics 2026-05-26 Feihu Liu , Sihao Tao , Guoce Xin

An efficient procedure for error-value calculations based on fast discrete Fourier transforms (DFT) in conjunction with Berlekamp-Massey-Sakata algorithm for a class of affine variety codes is proposed. Our procedure is achieved by…

Information Theory · Computer Science 2012-10-02 Hajime Matsui