English
Related papers

Related papers: Slide multiplicity free key polynomials

200 papers

In this article, we propose a few sufficient conditions on polynomials having integer coefficients all of whose zeros lie outside a closed disc centered at the origin in the complex plane and deduce the irreducibility over the ring of…

Number Theory · Mathematics 2019-08-23 Jitender Singh , Sanjeev Kumar

Confirming a conjecture of Mark Shimozono, we identify polynomial representatives for the Schubert classes of the affine Grassmannian as the k-Schur functions in homology and affine Schur functions in cohomology. Our results rely on Kostant…

Combinatorics · Mathematics 2007-05-23 Thomas Lam

We study geometric and topological properties of Hessenberg varieties of codimension one in the type A flag variety. Our main results: (1) give a formula for the Poincar\'e polynomial, (2) characterize when these varieties are irreducible,…

Algebraic Geometry · Mathematics 2026-04-22 Laura Escobar , Martha Precup , John Shareshian

Low rank tensor decompositions are a powerful tool for learning generative models, and uniqueness results give them a significant advantage over matrix decomposition methods. However, tensors pose significant algorithmic challenges and…

Data Structures and Algorithms · Computer Science 2014-01-21 Aditya Bhaskara , Moses Charikar , Ankur Moitra , Aravindan Vijayaraghavan

We develop a method for determining the density of squarefree values taken by certain multivariate integer polynomials that are invariants for the action of an algebraic group on a vector space. The method is shown to apply to the…

Number Theory · Mathematics 2014-02-04 Manjul Bhargava

Matrix Schubert varieties are affine varieties arising in the Schubert calculus of the complete flag variety. We give a formula for the Castelnuovo-Mumford regularity of matrix Schubert varieties, answering a question of Jenna Rajchgot. We…

Combinatorics · Mathematics 2021-11-23 Oliver Pechenik , David E Speyer , Anna Weigandt

This paper studies a class of so-called linear semi-infinite polynomial programming (LSIPP) problems. It is a subclass of linear semi-infinite programming problems whose constraint functions are polynomials in parameters and index sets are…

Optimization and Control · Mathematics 2019-10-25 Feng Guo , Xiaoxia Sun

The notion of multiplicity of a module first arose as consequence of Hilbert's work on commutative algebra, relating the dimension of rings with the degree of certain polynomials. For noncommutative rings, the notion of multiplicity first…

Rings and Algebras · Mathematics 2026-04-14 Jonas T. Hartwig , Erich C. Jauch , João Schwarz

We consider the class of all homogeneous, possibly non-reduced, polynomials $f$ whose associated reduced projective divisor $D_{\text{red}} \subset \mathbb{P}^{n-1}$ has (at worst) quasi-homogeneous isolated singularities. In an arbitrary…

Algebraic Geometry · Mathematics 2026-02-25 Daniel Bath , Willem Veys

We give upper bounds on the numbers of various classes of polynomials reducible over the integers and over integers modulo a prime and on the number of matrices in SL(n), GL(n) and Sp(2n) with reducible characteristic polynomials, and on…

Number Theory · Mathematics 2016-09-07 Igor Rivin

We show that every smooth Schubert variety of affine type $\tilde{A}$ is an iterated fibre bundle of Grassmannians, extending an analogous result by Ryan and Wolper for Schubert varieties of finite type $A$. As a consequence, we finish a…

Combinatorics · Mathematics 2017-02-09 Edward Richmond , William Slofstra

A. Booker and C. Pomerance (2017) have shown that any residue class modulo a prime $p\ge 11$ can be represented by a positive $p$-smooth square-free integer $s = p^{O(\log p)}$ with all prime factors up to $p$ and conjectured that in fact…

Number Theory · Mathematics 2020-02-05 Marc Munsch , Igor E. Shparlinski

In this paper, we consider the problem of determining the density of monic polynomials over $\mathbb{Z}_p$ with squarefree discriminant over various subsets of the set of monic polynomials over $\mathbb{Z}_p$ of fixed degree. We compute the…

Number Theory · Mathematics 2025-05-13 Gian Cordana Sanjaya

We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…

Probability · Mathematics 2009-03-06 Eugenijus Manstavičius

This paper studies the saddle point problem of polynomials. We give an algorithm for computing saddle points. It is based on solving Lasserre's hierarchy of semidefinite relaxations. Under some genericity assumptions on defining…

Optimization and Control · Mathematics 2021-06-10 Jiawang Nie , Zi Yang , Guangming Zhou

In this article we present applications of smooth numbers to the unconditional derandomization of some well-known integer factoring algorithms. We begin with Pollard's $p-1$ algorithm, which finds in random polynomial time the prime…

Number Theory · Mathematics 2009-05-12 Bartosz Zralek

The multi-variable Schmidt polynomials are defined by $$ S_n^{(r)}(x_0,\ldots,x_n):=\sum_{k=0}^n {n+k \choose 2k}^{r}{2k\choose k} x_k. $$ We prove that, for any positive integers $m$, $n$, $r$, and $\varepsilon=\pm 1$, all the coefficients…

Number Theory · Mathematics 2014-12-19 Qi-Fei Chen , Victor J. W. Guo

We obtain new lower bounds on the number of smooth squarefree integers up to $x$ in residue classes modulo a prime $p$, relatively large compared to $x$, which in some ranges of $p$ and $x$ improve that of A. Balog and C. Pomerance (1992).…

Number Theory · Mathematics 2019-03-11 Marc Munsch , Igor E. Shparlinski , Kam Hung Yau

Let $(G,H)$ be a reductive spherical pair and $P\subset H$ a parabolic subgroup such that $(G,P)$ is spherical. The triples $(G,H,P)$ with this property are called multiplicity free systems and they are classified in this paper. Denote by…

Representation Theory · Mathematics 2014-05-06 Maarten van Pruijssen

We describe an algorithm for fast multiplication of skew polynomials. It is based on fast modular multiplication of such skew polynomials, for which we give an algorithm relying on evaluation and interpolation on normal bases. Our…

Symbolic Computation · Computer Science 2017-02-07 Xavier Caruso , Jérémy Le Borgne