Combinatorial Nullstellensatz approach to polynomial expansion

2014 ◽  
Vol 165 (3) ◽  
pp. 279-282 ◽  
Author(s):  
Fedor Petrov
Keyword(s):  
Polynomial Expansion ◽  
Combinatorial Nullstellensatz

scholarly journals Coefficients of a Comprehensive Subclass of Meromorphic Bi-Univalent Functions Associated with the Faber Polynomial Expansion

Axioms ◽  
2021 ◽  
Vol 10 (1) ◽  
pp. 27
Author(s):  
Hari Mohan Srivastava ◽  
Ahmad Motamednezhad ◽  
Safa Salehian
Keyword(s):  
Unit Disk ◽  
Univalent Functions ◽  
Expansion Method ◽  
Upper Bounds ◽  
Polynomial Expansion ◽  
Open Unit ◽  
Open Unit Disk ◽  
Faber Polynomial ◽  
The Subject ◽  
Polynomial Expansion Method

In this paper, we introduce a new comprehensive subclass ΣB(λ,μ,β) of meromorphic bi-univalent functions in the open unit disk U. We also find the upper bounds for the initial Taylor-Maclaurin coefficients |b0|, |b1| and |b2| for functions in this comprehensive subclass. Moreover, we obtain estimates for the general coefficients |bn|(n≧1) for functions in the subclass ΣB(λ,μ,β) by making use of the Faber polynomial expansion method. The results presented in this paper would generalize and improve several recent works on the subject.

THE NUMBER OF ROOTS OF A POLYNOMIAL SYSTEM

2020 ◽  
pp. 1-10
Author(s):  
NGUYEN CONG MINH ◽  
LUU BA THANG ◽  
TRAN NAM TRUNG
Keyword(s):  
Polynomial Ring ◽  
Polynomial System ◽  
Combinatorial Nullstellensatz ◽  
Roots Of A Polynomial

Abstract Let I be a zero-dimensional ideal in the polynomial ring $K[x_1,\ldots ,x_n]$ over a field K. We give a bound for the number of roots of I in $K^n$ counted with combinatorial multiplicity. As a consequence, we give a proof of Alon’s combinatorial Nullstellensatz.

scholarly journals Combinatorial Nullstellensatz Modulo Prime Powers and the Parity Argument

10.37236/4124 ◽  
2014 ◽  
Vol 21 (4) ◽  
Author(s):  
László Varga
Keyword(s):  
Complexity Class ◽  
Combinatorial Nullstellensatz ◽  
Search Problem ◽  
Search Problems ◽  
Computational Search

We present new generalizations of Olson's theorem and of a consequence of Alon's Combinatorial Nullstellensatz. These enable us to extend some of their combinatorial applications with conditions modulo primes to conditions modulo prime powers. We analyze computational search problems corresponding to these kinds of combinatorial questions and we prove that the problem of finding degree-constrained subgraphs modulo $2^d$ such as $2^d$-divisible subgraphs and the search problem corresponding to the Combinatorial Nullstellensatz over $\mathbb{F}_2$ belong to the complexity class Polynomial Parity Argument (PPA).

scholarly journals An Efficient Polynomial Chaos Method for Stiffness Analysis of Air Spring Considering Uncertainties

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Feng Kong ◽  
Penghao Si ◽  
Shengwen Yin
Keyword(s):  
Orthogonal Polynomial ◽  
Polynomial Chaos ◽  
Random Variables ◽  
Expansion Method ◽  
Polynomial Expansion ◽  
Response Analysis ◽  
Air Spring ◽  
Stiffness Analysis ◽  
Orthogonal Polynomial Expansion ◽  
Sparse Quadrature

Traditional methods for stiffness analysis of the air spring are based on deterministic assumption that the parameters are fixed. However, uncertainties have widely existed, and the mechanic property of the air spring is very sensitive to these uncertainties. To model the uncertainties in the air spring, the interval/random variables models are introduced. For response analysis of the interval/random variables models of the air spring system, a new unified orthogonal polynomial expansion method, named as sparse quadrature-based interval and random moment arbitrary polynomial chaos method (SQ-IRMAPC), is proposed. In SQ-IRMAPC, the response of the acoustic system related to both interval and random variables is approximated by the moment-based arbitrary orthogonal polynomial expansion. To efficiently calculate the coefficient of the interval and random orthogonal polynomial expansion, the sparse quadrature is introduced. The proposed SQ-IRMAPC was employed to analyze the mechanic performance of an air spring with interval and/or random variables, and its effectiveness has been demonstrated by fully comparing it with the most recently proposed orthogonal polynomial-based interval and random analysis method.

scholarly journals Flow Dynamics in Restricted Geometries: A Mathematical Concept Based on Bloch NMR Flow Equation and Boubaker Polynomial Expansion Scheme

2013 ◽  
Vol 01 (05) ◽  
pp. 71-78 ◽  
Author(s):  
Omotayo Bamidele Awojoyogbe ◽  
Oluwaseun Michael Dada ◽  
Karem Boubaker ◽  
Omoniyi Adewale Adesola
Keyword(s):  
Mathematical Concept ◽  
Flow Equation ◽  
Flow Dynamics ◽  
Polynomial Expansion ◽  
Expansion Scheme

scholarly journals Algebraically Solvable Problems: Describing Polynomials as Equivalent to Explicit Solutions

10.37236/734 ◽  
2008 ◽  
Vol 15 (1) ◽  
Author(s):  
Uwe Schauz
Keyword(s):  
Combinatorial Nullstellensatz ◽  
Algebraic Solution ◽  
Explicit Solutions ◽  
Polynomial Map ◽  
Combinatorial Number Theory ◽  
Special Cases ◽  
The Matrix ◽  
Grid Points ◽  
Algebraic Solutions ◽  
Solvable Problems

The main result of this paper is a coefficient formula that sharpens and generalizes Alon and Tarsi's Combinatorial Nullstellensatz. On its own, it is a result about polynomials, providing some information about the polynomial map $P|_{\mathfrak{X}_1\times\cdots\times\mathfrak{X}_n}$ when only incomplete information about the polynomial $P(X_1,\dots,X_n)$ is given.In a very general working frame, the grid points $x\in \mathfrak{X}_1\times\cdots\times\mathfrak{X}_n$ which do not vanish under an algebraic solution – a certain describing polynomial $P(X_1,\dots,X_n)$ – correspond to the explicit solutions of a problem. As a consequence of the coefficient formula, we prove that the existence of an algebraic solution is equivalent to the existence of a nontrivial solution to a problem. By a problem, we mean everything that "owns" both, a set ${\cal S}$, which may be called the set of solutions; and a subset ${\cal S}_{\rm triv}\subseteq{\cal S}$, the set of trivial solutions.We give several examples of how to find algebraic solutions, and how to apply our coefficient formula. These examples are mainly from graph theory and combinatorial number theory, but we also prove several versions of Chevalley and Warning's Theorem, including a generalization of Olson's Theorem, as examples and useful corollaries.We obtain a permanent formula by applying our coefficient formula to the matrix polynomial, which is a generalization of the graph polynomial. This formula is an integrative generalization and sharpening of:1. Ryser's permanent formula.2. Alon's Permanent Lemma.3. Alon and Tarsi's Theorem about orientations and colorings of graphs.Furthermore, in combination with the Vigneron-Ellingham-Goddyn property of planar $n$-regular graphs, the formula contains as very special cases:4. Scheim's formula for the number of edge $n$-colorings of such graphs.5. Ellingham and Goddyn's partial answer to the list coloring conjecture.

Sign in / Sign up

Export Citation Format

Share Document