English
Related papers

Related papers: A mapping defined by the Schur-Szeg\H{o} compositi…

200 papers

The purpose of this article is to explore a few properties of polynomial shift-like automorphisms of $\mathbb{C}^k.$ We first prove that a $\nu-$shift-like polynomial map (say $S_a$) degenerates essentially to a polynomial map in…

Complex Variables · Mathematics 2018-10-02 Sayani Bera

Many-to-one mappings and permutation polynomials over finite fields have important applications in cryptography and coding theory. In this paper, we study the many-to-one property of a large class of polynomials such as $f(x) = h(a x^q + b…

Information Theory · Computer Science 2025-03-11 Yanbin Zheng , Meiying Zhang , Yanjin Ding , Zhengbang Zha , Qiang Wang

The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…

Commutative Algebra · Mathematics 2023-09-18 Ada Boralevi , Jasper van Doornmalen , Jan Draisma , Michiel E. Hochstenbach , Bor Plestenjak

The adjoint polynomial of $G$ is \[h(G,x)=\sum_{k=1}^n(-1)^{n-k}a_k(G)x^k,\] where $a_k(G)$ denotes the number of ways one can cover all vertices of the graph $G$ by exactly $k$ disjoint cliques of $G$. In this paper we show the the adjoint…

Combinatorics · Mathematics 2017-04-10 Ferenc Bencs

In [arXiv 0811.3913] the authors introduced the notion of quasi-polynomial function as being a mapping f: X^n -> X defined and valued on a bounded chain X and which can be factorized as f(x_1,...,x_n)=p(phi(x_1),...,phi(x_n)), where p is a…

Functional Analysis · Mathematics 2010-11-23 Miguel Couceiro , Jean-Luc Marichal

We give coefficient estimates for a class of close-to-convex harmonic mappings, and discuss the Fekete-Szeg\H{o} problem of it. We also introduce two classes of polyharmonic mappings $\mathcal{HS}_{p}$ and $\mathcal{HC}_{p}$, consider the…

Complex Variables · Mathematics 2013-10-01 Jiaolong Chen , Antti Rasila , Xiantao Wang

In characteristic zero, Zinovy Reichstein and the author generalized the usual relationship between irreducible Zariski closed subsets of the affine space, their defining ideals, coordinate rings, and function fields, to a non-commutative…

Rings and Algebras · Mathematics 2012-09-19 Nikolaus Vonessen

Since every even power of the Vandermonde determinant is a symmetric polynomial, we want to understand its decomposition in terms of the basis of Schur functions. We investigate several combinatorial properties of the coefficients in the…

Combinatorics · Mathematics 2015-06-03 Cristina Ballantine

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 give a criterion for a collection of polynomials to be a universal Gr\"{o}bner basis for an ideal in terms of the multidegree of the closure of the corresponding affine variety in $(\mathbb{P}^1)^N$. This criterion can be used to give…

Algebraic Geometry · Mathematics 2024-11-27 Daoji Huang , Matt Larson

It is well-known that a polynomial f(z)=a_d z^d(1+o(1)) can be conjugated by a holomorphic map phi to w \mapsto w^d in a neighbourhood of infinity. This map phi is called a B\"ottcher coordinate for f near infinity. In this paper we…

Complex Variables · Mathematics 2012-05-10 Alastair Fletcher , Robert Fryer

A set of functions is defined which is indexed by a positive integer $n$ and partitions of integers. The case $n=1$ reproduces the standard Schur polynomials. These functions are seen to arise naturally as a determinant of an action on the…

Algebraic Geometry · Mathematics 2007-05-23 Alex Kasman

We introduce a family of tableaux that simultaneously generalizes the tableaux used to characterize Grothendieck polynomials and k-Schur functions. We prove that the polynomials drawn from these tableaux are the affine Grothendieck…

Combinatorics · Mathematics 2009-07-02 Jennifer Morse

We consider a new stratification of the space of configurations of $n$ marked points on the complex plane. Recall that this space can be differently interpreted as the space $^{\rm D}{\rm Pol}_{n}$ of degree $n>1$ complex, monic polynomials…

Algebraic Geometry · Mathematics 2024-05-22 N. C. Combe

Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…

Number Theory · Mathematics 2018-09-05 Fusun Akman

Questions concerning small fractional parts of polynomials and pseudo-polynomials have a long history in analytic number theory. In this paper, we improve on earlier work by Madritsch and Tichy. In particular, let $f=P+\phi$ where $P$ is a…

Number Theory · Mathematics 2021-10-11 Paolo Minelli

We definitively establish that the theory of symmetric Macdonald polynomials aligns with quantum and affine Schubert calculus using a discovery that distinguished weak chains can be identified by chains in the strong (Bruhat) order poset on…

Combinatorics · Mathematics 2014-02-07 Avinash J. Dalal , Jennifer Morse

We study the symmetric function and polynomial combinatorial invariants of Hopf algebras of permutations, posets and graphs. We investigate their properties and the relations among them. In particular, we show that the chromatic symmetric…

Combinatorics · Mathematics 2020-10-01 Jean-christophe Aval , Nantel Bergeron , John Machacek

We introduce two families of symmetric functions with an extra parameter t that specialize to Schubert representatives for cohomology and homology of the affine Grassmannian when t = 1. The families are defined by a statistic on…

Combinatorics · Mathematics 2016-05-17 Avinash J. Dalal , Jennifer Morse

We prove various theorems on approximation using polynomials with integer coefficients in the Bernstein basis of any given order. In the extreme, we draw the coefficients from $\{ \pm 1\}$ only. A basic case of our results states that for…

Information Theory · Computer Science 2022-12-08 C. Sinan Güntürk , Weilin Li