English
Related papers

Related papers: The leading coefficient of Lascoux polynomials

200 papers

We consider the problem of learning a linear factor model. We propose a regularized form of principal component analysis (PCA) and demonstrate through experiments with synthetic and real data the superiority of resulting estimates to those…

Machine Learning · Computer Science 2013-05-31 Yi-Hao Kao , Benjamin Van Roy

Formanek made the conjecture that the minimal degree of the central polynomials for the $n\times n$ matrix algebra over a field of characteristic 0 is $(n^2+3n-2)/2$ and this is true for $n\leq 3$. For $n=4$ there are examples of central…

Rings and Algebras · Mathematics 2026-01-13 Vesselin Drensky , Boyan Kostadinov

The maximum likelihood threshold of a statistical model is the minimum number of datapoints required to fit the model via maximum likelihood estimation. In this paper we determine the maximum likelihood thresholds of generic linear…

Statistics Theory · Mathematics 2026-05-15 Daniel Irving Bernstein , Steven J. Gortler , Louis Theran

The symmetric subrank of homogeneous polynomial is the largest number of terms in a diagonal form to which it can be specialized by a (typically non-invertible) linear variable substitution. Building on earlier work by Derksen-Makam-Zuiddam…

Algebraic Geometry · Mathematics 2026-04-15 Benjamin Biaggi , Jan Draisma , Koen de Nooij , Immanuel van Santen

We present a coherent Bayesian framework for selection of the most likely model from the five genetic models (genotypic, additive, dominant, co-dominant, and recessive) commonly used in genetic association studies. The approach uses a…

Methodology · Statistics 2015-04-22 Harold Bae , Thomas Perls , Martin Steinberg , Paola Sebastiani

Let $X$ be a $d$-partite $d$-dimensional simplicial complex with parts $T_1,\dots,T_d$ and let $\mu$ be a distribution on the facets of $X$. Informally, we say $(X,\mu)$ is a path complex if for any $i<j<k$ and $F \in T_i,G \in T_j, K\in…

Combinatorics · Mathematics 2025-12-10 Jonathan Leake , Kasper Lindberg , Shayan Oveis Gharan

Polynomials with all the coefficients in $\{ 0,1\}$ and constant term 1 are called Newman polynomials, whereas polynomials with all the coefficients in $\{ -1,1\}$ are called Littlewood polynomials. By exploiting an algorithm developed…

Number Theory · Mathematics 2018-05-09 P. Drungilas , J. Jankauskas , G. Junevičius , L. Klebonas , J. Šiurys

We study the signs of the Fourier coefficients of a newform. Let $f$ be a normalized newform of weight $k$ for $\Gamma_0(N)$. Let $a_f(n)$ be the $n$th Fourier coefficient of $f$. For any fixed positive integer $m$, we study the…

Number Theory · Mathematics 2017-10-13 Jaban Meher , Karam Deo Shankhadhar , G. K. Viswanadham

In this note, we use a natural desingularization of the conormal variety of the variety of n x n symmetric matrices of rank at most r to find a general formula for the algebraic degree in semidefinite programming.

Algebraic Geometry · Mathematics 2009-09-09 Hans-Christian Graf von Bothmer , Kristian Ranestad

Linearized polynomials have attracted a lot of attention because of their applications in both geometric and algebraic areas. Let $q$ be a prime power, $n$ be a positive integer and $\sigma$ be a generator of…

Number Theory · Mathematics 2021-07-16 Paolo Santonastaso , Ferdinando Zullo

Infinite-dimensional Lie superalgebras, particularly Borcherds-Kac-Moody (BKM) superalgebras, play a fundamental role in mathematical physics, number theory, and representation theory. In this paper, we study the root multiplicities of BKM…

Combinatorics · Mathematics 2025-03-17 Chaithra P , Deniz Kus , R. Venkatesh

Using the theory of Newton Polygons, we formulate a simple criterion for the Galois group of a polynomial to be ``large.'' For a fixed $\alpha \in \Q - \Z_{<0}$, Filaseta and Lam have shown that the $n$th degree Generalized Laguerre…

Number Theory · Mathematics 2007-05-23 Farshid Hajir

Let f(x) = f(x_1, ..., x_n) = \sum_{|S| <= k} a_S \prod_{i \in S} x_i be an n-variate real multilinear polynomial of degree at most k, where S \subseteq [n] = {1, 2, ..., n}. For its "one-block decoupled" version, f~(y,z) = \sum_{|S| <= k}…

Discrete Mathematics · Computer Science 2015-12-08 Ryan O'Donnell , Yu Zhao

A method of generating differential operators is used to solve the spectral problem for a generalisation of the Sylvester-Kac matrix. As a by-product, we find a linear differential operator with polynomial coefficients of the first order…

Classical Analysis and ODEs · Mathematics 2021-07-12 Alexander Dyachenko , Mikhail Tyaglov

The set ${\cal P}^{m\times n}_{r,d}$ of $m \times n$ complex matrix polynomials of grade $d$ and (normal) rank at most $r$ in a complex $(d+1)mn$ dimensional space is studied. For $r = 1, \dots , \min \{m, n\}-1$, we show that ${\cal…

Numerical Analysis · Mathematics 2016-12-14 Andrii Dmytryshyn , Froilán M. Dopico

We prove a recent conjecture of Lassalle about positivity and integrality of coefficients in some polynomial expansions. We also give a combinatorial interpretation of those numbers. Finally, we show that this question is closely related to…

Combinatorics · Mathematics 2007-05-23 F. Jouhet , B. Lass , J. Zeng

Motivated by Stanley's generalization of the chromatic polynomial of a graph to the chromatic symmetric function, we introduce the characteristic polynomial of a representation of the symmetric group, or more generally, of a symmetric…

Algebraic Geometry · Mathematics 2025-11-05 Jinwon Choi , Young-Hoon Kiem , Donggun Lee

We generalize Coincidence theorem due to Walsh for symmetric and linear polynomial in n complex variables, that is linear in each of them having total degre n. We discuss case when total degree is smaller then n. This case has been already…

Complex Variables · Mathematics 2023-05-29 Rados Bakic

In this paper we obtain some statements concerning ideals of polynomials and apply these results in a number of different situations. Among other results, we present new characterizations of $\mathcal{L}_{\infty}$-spaces, Coincidence…

Functional Analysis · Mathematics 2007-05-23 Daniel M. Pellegrino

A second order polynomial sequence is of \emph{Fibonacci-type} (\emph{Lucas-type}) if its Binet formula has a structure similar to that for Fibonacci (Lucas) numbers. Known examples of these type of sequences are: Fibonacci polynomials,…

Number Theory · Mathematics 2018-08-06 Rigoberto Flórez , Robinson Higuita , Alexander Ramírez
‹ Prev 1 8 9 10 Next ›