Related papers: An efficient algorithm for deciding vanishing of S…
Let $E$ be a vector bundle and $L$ be a line bundle over a smooth projective variety $X$. In this article, we give a condition for the vanishing of Dolbeault cohomology groups of the form $H^{p,q}(X,\SSS^{\alpha}E\otimes \wedge^{\beta}…
We study an action of the skew divided difference operators on the Schubert polynomials and give an explicit formula for structural constants for the Schubert polynomials in terms of certain weighted paths in the Bruhat order on the…
We study the factorization of Schubert polynomials into elementary symmetric polynomials. We conjecture that this occurs when the permutation corresponding to the Schubert polynomial does not contain the patterns $1432$, $1423$, $4132$, and…
Vladimir Shpilrain and Jie-Tai Yu have asked for an effective algorithm to decide if two elements of C[x,y] are related by an automorphism of C[x,y]. We describe here an efficient algorithm that decides this question and finds the…
Let $ K $ be a number field, $ S $ a finite set of places of $ K $, and $ \mathcal{O}_S $ be the ring of $ S $-integers. Moreover, let $$ G_n^{(0)} Z^d + \cdots + G_n^{(d-1)} Z + G_n^{(d)} $$ be a polynomial in $ Z $ having simple linear…
We study the problem of factoring univariate polynomials over finite fields. Under the assumption of the Extended Riemann Hypothesis (ERH), (Gao, 2001) designed a polynomial time algorithm that fails to factor only if the input polynomial…
We present an algorithm which computes the multilinear factors of bivariate lacunary polynomials. It is based on a new Gap Theorem which allows to test whether a polynomial of the form P(X,X+1) is identically zero in time polynomial in the…
For all algebraic groups over non-Archimedean local fields, the bounded cohomology vanishes. This follows from the corresponding statement for automorphism groups of Bruhat--Tits buildings, which hinges on the solution to the flatmate…
We discuss existence of explicit search bounds for zeros of polynomials with coefficients in a number field. Our main result is a theorem about the existence of polynomial zeros of small height over the field of algebraic numbers outside of…
We show that the compactly supported cohomology of Shimura varieties of Hodge type of infinite $\Gamma_1(p^\infty)$-level (defined with respect to a Borel subgroup) vanishes above the middle degree, under the assumption that the group of…
The Schubert problem asks for combinatorial models to compute structure constants of the cohomology ring with respect to Schubert classes and has been an important open problem in algebraic geometry and combinatorics that guided fruitful…
By viewing the regular $N$-gon as the set of $N$th roots of unity in the complex plane we transform several questions regarding polygon diagonals into when a polynomial vanishes when evaluated at roots of unity. To study these solutions we…
We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…
The problem of constructing a perfect cuboid is related to a certain class of univariate polynomials with three integer parameters $a$, $b$, and $u$. Their irreducibility over the ring of integers under certain restrictions for $a$, $b$,…
We propose an algorithm for finding zero divisors in quaternion algebras over quadratic number fields, or equivalently, solving homogeneous quadratic equations in three variables over $\mathbb{Q}(\sqrt{d})$ where $d$ is a square-free…
Let $G$ be a classical complex Lie group, $P$ any parabolic subgroup of $G$, and $G/P$ the corresponding partial flag variety. We prove an explicit combinatorial Giambelli formula which expresses an arbitrary Schubert class in the…
We show that the shadow vertex simplex algorithm can be used to solve linear programs in strongly polynomial time with respect to the number $n$ of variables, the number $m$ of constraints, and $1/\delta$, where $\delta$ is a parameter that…
We generalize classical triangular Schubert puzzles to puzzles with convex polygonal boundary. We give these puzzles a geometric Schubert calculus interpretation and derive novel combinatorial commutativity statements, using purely…
The distinguishing result of this paper is a $\mathbf{P}$-time enumerable partition of all the potential perfect matchings in a bipartite graph. This partition is a set of equivalence classes induced by the missing edges in the potential…
Given a zero-dimensional ideal I in a polynomial ring, many computations start by finding univariate polynomials in I. Searching for a univariate polynomial in I is a particular case of considering the minimal polynomial of an element in…