English
Related papers

Related papers: The leading coefficient of Lascoux polynomials

200 papers

We present a certain generalization of a recent result of M. I. Cirnu on linear recurrence relations with coefficient in progressions [2]. We provide some interesting examples related to some well-known integer sequences, such as Fibonacci…

Number Theory · Mathematics 2015-03-19 Jerico B. Bacani , Julius Fergy T. Rabago

In this work, we define a more general family of polynomials in several variables satisfying a linear recurrence relation. Then we provide explicit formulas and determinantal expressions. Finally, we apply these results to recurrent…

Number Theory · Mathematics 2023-05-23 Said Zriaa , Mohammed Mouçouf

It is known that point searching in basic semialgebraic sets and the search for globally minimal points in polynomial optimization tasks can be carried out using $(s\,d)^{O(n)}$ arithmetic operations, where $n$ and $s$ are the numbers of…

Symbolic Computation · Computer Science 2014-02-11 Bernd Bank , Marc Giusti , Joos Heintz , Mohab Safey El Din

We give a new method to calculate the universal cohomology classes of coincident root loci. We show a polynomial behavior of them and apply this result to prove that generalized Pl\"ucker formulas are polynomials in the degree, just as the…

Algebraic Geometry · Mathematics 2025-03-28 László M. Fehér , András P. Juhász

We present conjectures giving formulas for the Macdonald polynomials of type B, C, D which are indexed by a multiple of the first fundamental weight. The transition matrices between two different types are explicitly given.

Combinatorics · Mathematics 2008-03-05 Michel Lassalle

We study sets of integers that can be defined by the vanishing of a generalised polynomial expression. We show that this includes sets of values of linear recurrent sequences of Salem type and some linear recurrent sequences of Pisot type.…

Number Theory · Mathematics 2023-02-14 Jakub Byszewski , Jakub Konieczny

For integers $b$ and $c$ the generalized central trinomial coefficient $T_n(b,c)$ denotes the coefficient of $x^n$ in the expansion of $(x^2+bx+c)^n$. Those $T_n=T_n(1,1)\ (n=0,1,2,\ldots)$ are the usual central trinomial coefficients, and…

Number Theory · Mathematics 2014-06-18 Zhi-Wei Sun

We consider statistical models arising from the common set of solutions to a sparse polynomial system with general coefficients. The maximum likelihood degree counts the number of critical points of the likelihood function restricted to the…

Algebraic Geometry · Mathematics 2022-04-20 Julia Lindberg , Nathan Nicholson , Jose Israel Rodriguez , Zinan Wang

The number of non-isomorphic cubic fields L sharing a common discriminant d(L) = d is called the multiplicity m = m(d) of d. For an assigned value of d, these fields are collected in a multiplet M(d) = (L(1) ,..., L(m)). In this paper, the…

Number Theory · Mathematics 2021-02-25 Daniel C. Mayer

We propose a theory of double Schubert polynomials P_w(X,Y) for the Lie types B, C, D which naturally extends the family of Lascoux of Schutzenberger in type A. These polynomials satisfy positivity, orthogonality, and stability properties,…

Algebraic Geometry · Mathematics 2007-05-23 Andrew Kresch , Harry Tamvakis

We study integer coefficient polynomials of fixed degree and maximum height $H$, that are irreducible by Dumas's criterion. We call such polynomials Dumas polynomials. We derive upper bounds on the number of Dumas polynomials, as $H$…

Number Theory · Mathematics 2017-07-12 Randell Heyman

In this study we introduce a second type of higher order generalised geometric polynomials. This we achieve by examining the generalised stirling numbers $S(n; k;\alpha;\beta;\gamma)$ [Hsu & Shiue,1998] for some negative arguments. We study…

Let K be a field and let M_n(K) denote the space of n x n matrices with entries in K. Let M be a subspace of M_n(K) of dimension d with the property that there are elements in M with non-zero determinant. Given a basis of M, we define the…

Rings and Algebras · Mathematics 2021-12-15 Rod Gow

We consider the problem of minimizing a given $n$-variate polynomial $f$ over the hypercube $[-1,1]^n$. An idea introduced by Lasserre, is to find a probability distribution on $[-1,1]^n$ with polynomial density function $h$ (of given…

Optimization and Control · Mathematics 2017-07-03 Etienne de Klerk , Roxana Hess , Monique Laurent

Starting from Montgomery's conjecture, there has been a substantial interest on the connections of random matrix theory and the theory of L-functions. In particular, moments of characteristic polynomials of random matrices have been…

Probability · Mathematics 2024-02-07 Mustafa Alper Gunes

Linear recursions of degree $k$ are determined by evaluating the sequence of Generalized Fibonacci Polynomials, $\{F_{k,n}(t_1,...,t_k)\}$ (isobaric reflects of the complete symmetric polynomials) at the integer vectors $(t_1,...,t_k)$. If…

Number Theory · Mathematics 2007-05-23 Trueman MacHenry , Kieh Wong

There is a remarkable formula for the principal specialization of a type A Schubert polynomial as a weighted sum over reduced words. Taking appropriate limits transforms this to an identity for the backstable Schubert polynomials recently…

Combinatorics · Mathematics 2022-01-20 Eric Marberg , Brendan Pawlowski

In this paper, a new kind of resultant, called the determinantal resultant, is introduced. This operator computes the projection of a determinantal variety under suitable hypothesis. As a direct generalization of the resultant of a very…

Algebraic Geometry · Mathematics 2007-05-23 Laurent Buse

Let $\alpha\in(0,1)\setminus{\Bbb Q}$ and $K=\{(e^z,e^{\alpha z}):\,|z|\leq1\}\subset{\Bbb C}^2$. If $P$ is a polynomial of degree $n$ in ${\Bbb C}^2$, normalized by $\|P\|_K=1$, we obtain sharp estimates for $\|P\|_{\Delta^2}$ in terms of…

Complex Variables · Mathematics 2010-09-23 Dan Coman , Evgeny A. Poletsky

In this paper a general theory of semi-classical matrix orthogonal polynomials is developed. We define the semi-classical linear functionals by means of a distributional equation $D(u A) = u B,$ where $A$ and $B$ are matrix polynomials.…

Classical Analysis and ODEs · Mathematics 2007-05-23 M. J. Cantero , L. Moral , L. Velazquez