English
Related papers

Related papers: Gauss' lemma for polynomials over semidomains

200 papers

This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…

Classical Analysis and ODEs · Mathematics 2008-03-11 Steve Fisk

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

We provide upper bounds for the cardinality of the value set of a polynomial map in several variables over a finite field. These bounds generalize earlier bounds for univariate polynomials.

Number Theory · Mathematics 2012-10-31 Gary L. Mullen , Daqing Wan , Qiang Wang

In this note, we provide a simple derivation of expressions for the restricted partition function and its polynomial part. Our proof relies on elementary algebra on rational functions and a lemma that expresses the polynomial part as an…

Combinatorics · Mathematics 2018-02-22 S. Robins , C. Vignat

A quadrature rule of a measure $\mu$ on the real line represents a convex combination of finitely many evaluations at points, called nodes, that agrees with integration against $\mu$ for all polynomials up to some fixed degree. In this…

Numerical Analysis · Mathematics 2021-02-08 Grigoriy Blekherman , Mario Kummer , Cordian Riener , Markus Schweighofer , Cynthia Vinzant

In this paper we present a unified method for solving general polynomial equations of degree less than five.

General Mathematics · Mathematics 2022-01-05 Raghavendra G. Kulkarni

Let g be a nonconstant rational map from the projective line to itself that has degree greater than one and is defined over a number field. The map g gives rise to generalized Mahler measures for polynomials in one variable. We use…

Number Theory · Mathematics 2007-05-23 Lucien Szpiro , Thomas J. Tucker

We construct many irreducible polynomials within semigroups generated by sets of the form $S=\{x^2+c_1,\dots,x^2+c_s\}$ under composition.

Number Theory · Mathematics 2022-08-09 Wade Hindes , Reiyah Jacobs , Peter Ye

Generalized Feller theory provides an important analog to Feller theory beyond locally compact state spaces. This is very useful for solutions of certain stochastic partial differential equations, Markovian lifts of fractional processes, or…

Probability · Mathematics 2023-08-09 Christa Cuchiero , Tonio Möllmann , Josef Teichmann

The question of polynomial learnability of probability distributions, particularly Gaussian mixture distributions, has recently received significant attention in theoretical computer science and machine learning. However, despite major…

Machine Learning · Computer Science 2010-05-13 Mikhail Belkin , Kaushik Sinha

We consider the problem of defining polynomials over function fields of positive characteristic. Among other results, we show that the following assertions are true. 1. Let $\G_p$ be an algebraic extension of a field of $p$ elements and…

Number Theory · Mathematics 2015-02-11 Alexandra Shlapentokh

We discuss the symmetric homogeneous polynomial solutions of the generalized Laplace's equation which arises in the context of the Calogero-Sutherland model on a line. The solutions are expressed as linear combinations of Jack polynomials…

solv-int · Physics 2009-10-30 S. Chaturvedi

A simple algorithm to compute all the zeros of a generic polynomial is proposed.

Classical Analysis and ODEs · Mathematics 2016-09-21 Francesco Calogero

We provide upper bounds on the total number of irreducible factors, and in particular irreducibility criteria for some classes of bivariate polynomials $f(x,y)$ over an arbitrary field $\mathbb{K}$. Our results rely on information on the…

Number Theory · Mathematics 2025-03-04 Nicolae Ciprian Bonciocat , Rishu Garg , Jitender Singh

Consider a semi-algebraic set A in R^d constructed from the sets which are determined by inequalities p_i(x)>0, p_i(x)\ge 0, or p_i(x)=0 for a given list of polynomials p_1,...,p_m. We prove several statements that fit into the following…

Algebraic Geometry · Mathematics 2008-05-06 Gennadiy Averkov

We prove an extension of the Thue-Vinogradov Lemma and show some applications. This paper is another example for the application of the polynomial method.

Number Theory · Mathematics 2020-09-29 Jozsef Solymosi

In this note the usual Goursat lemma, which describes subgroups of the direct product of two groups, is generalized to describing subgroups of a direct product $A_1\times A_2 \times...\times A_n$ of a finite number of groups. Other possible…

Group Theory · Mathematics 2015-06-10 Kristine Bauer , Debasis Sen , Peter Zvengrowski

In this paper, we consider a general form of the analogue of Ramanujan's sum in the ring of polynomials over a finite field. We first prove some multiplicative properties of such functions before considering their finite Fourier series and…

Number Theory · Mathematics 2019-09-30 J. C. Andrade , J. R. P. Hanslope

We study solutions of exponential polynomials over the complex field. Assuming Schanuel's conjecture we prove that certain polynomials have generic solutions in the complex field.

Logic · Mathematics 2016-02-08 P. D'Aquino , A. Fornasiero , G. Terzo

We study generalizations of Schur functors from categories consisting of flags of vector spaces. We give different descriptions of the category of such functors in terms of representations of certain combinatorial categories and infinite…

Representation Theory · Mathematics 2024-02-19 Teresa Yu
‹ Prev 1 4 5 6 7 8 10 Next ›