English
Related papers

Related papers: Pl\"ucker formulas using equivariant cohomology of…

200 papers

Generalized Pl\"ucker numbers are defined to count certain types of tangent lines of generic degree $d$ complex projective hypersurfaces. They can be computed by identifying them as coefficients of GL(2)-equivariant cohomology classes of…

Algebraic Geometry · Mathematics 2024-06-26 András P. Juhász

We compute the degree of the generalized Pl\"ucker embedding $\kappa$ of a Quot scheme $X$ over $\PP^1$. The space $X$ can also be considered as a compactification of the space of algebraic maps of a fixed degree from $\PP^1$ to the…

alg-geom · Mathematics 2017-01-06 M. S. Ravi , J. Rosenthal , X. Wang

We prove a formula which compares intersection numbers of conormal varieties of two projective varieties and their dual varieties. When one of them is linear, we can recover the usual Plucker formula for the degree of the dual variety. The…

Algebraic Geometry · Mathematics 2007-05-23 Naichung Conan Leung

An important combinatorial result in equivariant cohomology and $K$-theory Schubert calculus is represented by the formulas of Billey and Graham-Willems for the localization of Schubert classes at torus fixed points. These formulas work…

Algebraic Geometry · Mathematics 2017-11-01 Cristian Lenart , Kirill Zainoulline

Coincident root loci are subvarieties of $S^d(C^2)$--the space of binary forms of degree $d$--labelled by partitions of $d$. Given a partition $\lambda$, let $X_\lambda$ be the set of forms with root multiplicity corresponding to $\lambda$.…

Algebraic Geometry · Mathematics 2007-05-23 L. M. Feher , A. Nemethi , R. Rimanyi

We enumerate complex algebraic hypersurfaces in $P^n$, of a given (high) degree with one singular point of a given singularity type. Our approach is to compute the (co)homology classes of the corresponding equi-singular strata in the…

Algebraic Geometry · Mathematics 2014-02-26 Dmitry Kerner

The multiple root loci among univariate polynomials of degree $n$ are indexed by partitions of $n$. We study these loci and their conormal varieties. The projectively dual varieties are joins of such loci where the partitions are hooks. Our…

Algebraic Geometry · Mathematics 2015-10-26 Hwangrae Lee , Bernd Sturmfels

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

Symbolic Computation · Computer Science 2017-04-14 Victor Y. Pan , Liang Zhao

Over the complex numbers, Pl\"ucker's formula computes the number of inflection points of a linear series of projective dimension $r$ and degree $d$ on a curve of genus $g$. Here we explore the geometric meaning of a natural analogue of…

Algebraic Geometry · Mathematics 2026-02-24 Ethan Cotterill , Ignacio Darago , Changho Han

We compute bifunctors cohomology for matrix polynomials under conjugation and detect candidates for universal classes in higher invariant theory.

K-Theory and Homology · Mathematics 2016-08-14 Antoine Touzé

Motivated by representation theory and geometry, we introduce and develop an equivariant generalization of Ehrhart theory, the study of lattice points in dilations of lattice polytopes. We prove representation-theoretic analogues of…

Combinatorics · Mathematics 2014-12-05 Alan Stapledon

We establish the formula for multiplication by the class of a special Schubert variety in the integral cohomology ring of the flag manifold. This formula also describes the multiplication of a Schubert polynomial by either an elementary…

alg-geom · Mathematics 2008-02-03 Frank Sottile

We want to compute generic $\mathrm{Ext}$-spaces of twisted polynomial functors in relation to the $\mathrm{Ext}$-spaces of the untwisted ones, modulo a parametrisation. Thanks to the study of a spectral sequence we get to a computation in…

Algebraic Topology · Mathematics 2026-01-28 Iacopo Giordano

Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…

Numerical Analysis · Mathematics 2014-07-01 Victor Y. Pan

The computation of the topology of a real algebraic plane curve is greatly simplified if there are no more than one critical point in each vertical line: the general position condition. When this condition is not satisfied, then a finite…

Algebraic Geometry · Mathematics 2023-03-07 Jorge Caravantes , Gema M. Diaz-Toca , Laureano Gonzalez-Vega

We provide a unified, elementary, topological approach to the classical results stating the continuity of the complex roots of a polynomial with respect to its coefficients, and the continuity of the coefficients with respect to the roots.…

General Mathematics · Mathematics 2012-06-11 Branko Ćurgus , Vania Mascioni

The P-Eulerian polynomial counts the linear extensions of a labeled partially ordered set, P, by their number of descents. It is known that the P-Eulerian polynomials are real-rooted for various classes of posets P. The purpose of this…

Combinatorics · Mathematics 2016-04-15 Petter Brändén , Madeleine Leander

A unitary cyclotomic polynomial of order three is a polynomial of the form \[ \Phi^*_{PQR}(x)=\frac{(x^{PQR}-1)(x^P-1)(x^Q-1)(x^R-1)}{(x^{PQ}-1)(x^{QR}-1)(x^{RP}-1)(x-1)}, \] where $P$, $Q$ and $R$ are powers of three distinct primes $p$,…

Number Theory · Mathematics 2021-11-18 Gennady Bachman

Assume that the coefficients of a polynomial in a complex variable are Laurent polynomials in some complex parameters. The parameter space (a complex torus) splits into strata corresponding to different combinations of coincidence of the…

Algebraic Geometry · Mathematics 2010-11-23 Gleb G. Gusev

In this paper, we will show dichotomy theorems for the computation of polynomials corresponding to evaluation of graph homomorphisms in Valiant's model. We are given a fixed graph $H$ and want to find all graphs, from some graph class,…

Computational Complexity · Computer Science 2014-12-02 Christian Engels
‹ Prev 1 2 3 10 Next ›