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

A V_{12} Fano threefold is a smooth Fano threefold X of index 1 with Pic X = Z and (-K_X)^3=12. We show that the bounded derived category of coherent sheaves on any V_{12} threefold X admits a semiorthogonal decomposition consisting of two…

Polynomial system solving is a classical problem in mathematics with a wide range of applications. This makes its complexity a fundamental problem in computer science. Depending on the context, solving has different meanings. In order to…

Given a knot K in an Euclidean space E and a finite dimensional space V of smooth functions on K, we express the expected number of critical points of a random function in V in terms of an integral-geometric invariant of K and V. When V…

Let F(X_d) be a smooth Fano variety of lines of a hypersurface X_d of degree d. In this paper, we prove the Griffiths group Griff_1(F(X_d)) is trivial if the hypersurface X_d is of 2-Fano type. As a result, we give a positive answer to a…

In 2019, Xiang Fan \cite{xfan} classified all permutation polynomials of degree $7$ over finite fields of odd characteristics. In this paper, we use this classification to determine the complete list of degree $7$ orthomorphism polynomials…

Identification of the mechanically exfoliated graphene flakes and classification of the thickness is important in the nanomanufacturing of next-generation materials and devices that overcome the bottleneck of Moore's Law. Currently,…

A polynomial algorithm for graphs' isomorphism testing is constructed in assumption that there exists a corresponding polynomial algorithm for graphs with trivial automorphism group.

For a lattice $L$ of $R^n$, a sphere $S(c,r)$ of center $c$ and radius $r$ is called {\em empty} if for any $v\in L$ we have $\Vert v - c\Vert \geq r$. Then the set $S(c,r)\cap L$ is the vertex set of a {\em Delaunay polytope}…

We give a complete enumeration of all 2-neighborly 0/1-polytopes of dimension 7. There are 13 959 358 918 different 0/1-equivalence classes of such polytopes. They form 5 850 402 014 combinatorial classes and 1 274 089 different f-vectors.…

We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(n D kappa(f)) iterations where n is the number of polynomials (as well as the dimension of the ambient space), D…

A polynomial representation of a convex d-polytope P is a finite set \{p_1(x),...,p_n(x)\} of polynomials over E^d such that P=\setcond{x \in \E^d}{p_1(x) \ge 0 {for every} 1 \le i \le n}. By s(d,P) we denote the least possible number of…

In this paper, we give a polynomial-time algorithm for deciding whether an input bipartite graph admits a 2-layer fan-planar drawing, resolving an open problem posed in several papers since 2015.

We introduce a general class of symmetric polynomials that have saturated Newton polytope and their Newton polytope has integer decomposition property. The class covers numerous previously studied symmetric polynomials.

Fano manifolds are basic building blocks in geometry - they are, in a precise sense, atomic pieces of shapes. The classification of Fano manifolds is therefore an important problem in geometry, which has been open since the 1930s. One can…

Using the cyclotomic identity we compute sums over d-tuples of monic polynomials in F_q[x] weighted by the multiplicity of their irreducible factors. As consequences we determine explicit expressions for the number of d-tuples of…

We study the geometry of the Fano schemes $\mathrm{\textbf{F}}_{k}(\mathrm{SD}_n^r)$ of the projective variety $\mathrm{SD}_n^r$ defined by the $r\times r$ minors of a symmetric $n\times n$ matrix filled with indeterminates. These schemes…

In this paper, a deep convolutional neural network architecture for galaxies classification is presented. The galaxy can be classified based on its features into main three categories Elliptical, Spiral, and Irregular. The proposed deep…

We classify, up to diffeomorphism, all closed smooth manifolds homeomorphic to the complex projective $n$-space $\mathbb{C}\textbf{P}^n$, where $n=3$ and $4$. Let $M^{2n}$ be a closed smooth $2n$-manifold homotopy equivalent to…

Large integer factorization is a prominent research challenge, particularly in the context of quantum computing. This holds significant importance, especially in information security that relies on public key cryptosystems. The classical…

We describe in the space of binary forms of degree d the strata of forms having constant rank. We also give a simple algorithm to determine the rank of a given form.