Related papers: An efficient algorithm for deciding vanishing of S…
We present an exact and complete algorithm to isolate the real solutions of a zero-dimensional bivariate polynomial system. The proposed algorithm constitutes an elimination method which improves upon existing approaches in a number of…
Finding the solutions to a system of multivariate polynomial equations is a fundamental problem in mathematics and computer science. It involves evaluating the polynomials at many points, often chosen from a grid. In most current methods,…
We extend the short presentation due to [Borel '53] of the cohomology ring of a generalized flag manifold to a relatively short presentation of the cohomology of any of its Schubert varieties. Our result is stated in a root-system uniform…
We develop the Littlewood-Richardson homotopy algorithm, which uses numerical continuation to compute solutions to Schubert problems on Grassmannians and is based on the geometric Littlewood-Richardson rule. One key ingredient of this…
We prove Grauert-Riemenschneider-type vanishing theorems for excellent dlt threefolds pairs whose closed points have perfect residue fields of positive characteristic $p>5$. Then we discuss applications to dlt singularities and to Mori…
One hundred years ago, Hilbert gave a list of important open problems in mathematics. His 15th problem asked for the development of a rigorous calculus explaining Schubert's enumerative results for intersecting varieties defined by rank…
We give a pattern-avoidance characterization of $w \in S_n$ such that the Schubert polynomial $\mathfrak{S}_w$ is a standard elementary monomial. This characterization tells us which quantum Schubert polynomials are easiest to compute. We…
We obtain several Cauchy-like and Pellet-like results for the zeros of a general complex polynomial by considering similarity transformations of the squared companion matrix and the reformulation of the zeros of a scalar polynomial as the…
Let $g(X)$ be a polynomial over a finite field ${\mathbb F}_q$ with degree $o(q^{1/2})$, and let $\chi$ be the quadratic residue character. We give a polynomial time algorithm to recover $g(X)$ (up to perfect square factors) given the…
We prove a criterion of when the dual character $\chi_{D}(x)$ of the flagged Weyl module associated to a diagram $D$ in the grid $[n]\times [n]$ is zero-one, that is, the coefficients of monomials in $\chi_{D}(x)$ are either 0 or 1. This…
Present notes can be viewed as an attempt to extend the notion of Schubert/Grothendieck polynomial to the context of an arbitrary algebraic oriented cohomology theory and, hence, of a commutative one-dimensional formal group law.
In this paper we develop techniques that eliminate the need of the Generalized Riemann Hypothesis (GRH) from various (almost all) known results about deterministic polynomial factoring over finite fields. Our main result shows that given a…
Given a separable nonconstant polynomial $f(x)$ with integer coefficients, we consider the set $S$ consisting of the squarefree parts of all the rational values of $f(x)$, and study its behavior modulo primes. Fixing a prime $p$, we…
It is conjectured that all separable polynomials with integers coefficients, satisfying some local conditions, take infinitely many square free values on integer arguments. But not a single polynomial of degree greater than $3$ is proven to…
Recently the problem of constructing a perfect Euler cuboid was related with three conjectures asserting the irreducibility of some certain three polynomials depending on integer parameters. In this paper a partial result toward proving the…
In this paper we show that certain special cases of the hidden subgroup problem can be solved in polynomial time by a quantum algorithm. These special cases involve finding hidden normal subgroups of solvable groups and permutation groups,…
In this paper we prove a new generic vanishing theorem for $X$ a complete homogeneous variety with respect to an action of a connected algebraic group. Let $A, B_0\subset X$ be locally closed affine subvarieties, and assume that $B_0$ is…
We reexamine the classical subset sum problem: given a set $X$ of $n$ positive integers and a number $t$, decide whether there exists a subset of $X$ that sums to $t$; or more generally, compute the set $\mbox{out}$ of all numbers…
We calculate the zeros of an exponential polynomial of three variables by a classical algorithm and quantum algorithms which are based on the method of van Dam and Shparlinski, they treated the case of two variables, and compare with the…
We reprove and generalize the result that the intersection cohomology groups of a toric variety with coefficient in a nontrivial rank one local system vanish. We prove a similar vanishing result for a certain class of varieties on which a…