Results 31 to 40 of about 3,729,724 (366)
On the generalized Davenport constant and the Noether number [PDF]
Known results on the generalized Davenport constant related to zero-sum sequences over a finite abelian group are extended to the generalized Noether number related to the rings of polynomial invariants of an arbitrary finite group.
A Geroldinger +19 more
core +1 more source
Constant Terms of Near-Dyson Polynomials [PDF]
We formulate and prove a formula for the constant term for a certain class of Laurent polynomials, which include the Dyson conjecture and its generalizations by Bressoud and Goulden. Our method is explicit Combinatorial Nullstellensatz.
openaire +2 more sources
Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor [PDF]
Ye [2011] showed recently that the simplex method with Dantzig’s pivoting rule, as well as Howard’s policy iteration algorithm, solve discounted Markov decision processes (MDPs), with a constant discount factor, in strongly polynomial time.
Thomas Dueholm Hansen +2 more
semanticscholar +1 more source
Hamming distance from irreducible polynomials over $\mathbb {F}_2$ [PDF]
We study the Hamming distance from polynomials to classes of polynomials that share certain properties of irreducible polynomials. The results give insight into whether or not irreducible polynomials can be effectively modeled by these more general ...
Gilbert Lee +2 more
doaj +1 more source
Bounds for sets with no polynomial progressions [PDF]
Let $P_1,\dots ,P_m\in \mathbb{Z} [y]$ be polynomials with distinct degrees, each having zero constant term. We show that any subset A of $\{1,\dots ,N\}$ with no nontrivial progressions of the form $x,x+P_1(y),\dots ,x+P_m(y)$ has size $|A|\ll N/(\log ...
Sarah Peluse
semanticscholar +1 more source
A Non-NP-Complete Algorithm for a Quasi-Fixed Polynomial Problem
Let be a real-valued polynomial function of the form , with degree of in An irreducible real-valued polynomial function and a nonnegative integer are given to find a polynomial function satisfying the following expression: for some constant .
Yi-Chou Chen, Hang-Chin Lai
doaj +1 more source
We prove that the minimizer in the Nédélec polynomial space of some degree $p\ge 0$ of a discrete minimization problem performs as well as the continuous minimizer in $H({\bf curl})$, up to a constant that is independent of the polynomial degree $p$. The
Chaumont-Frelet, Théophile +2 more
doaj +1 more source
Sharp values for the constants in the polynomial Bohnenblust-Hille inequality [PDF]
In this paper we prove that the complex polynomial Bohnenblust-Hille constant for $2$-homogeneous polynomials in ${\mathbb C}^2$ is exactly $\sqrt[4]{\frac{3}{2}}$.
Jiménez-Rodríguez, P. +3 more
core +6 more sources
Meromorphic function sharing a small function with a linear differential polynomial [PDF]
The problem of uniqueness of an entire or a meromorphic function when it shares a value or a small function with its derivative became popular among the researchers after the work of Rubel and Yang (1977).
Indrajit Lahiri, Amit Sarkar
doaj +1 more source
Problems on multivariate reliability polynomial
The original results include: (i) homogenization of a reliability polynomial; (ii) compact hypersurfaces attached to homogeneous polynomials; (iii) an affine diffeomorphism that preserves a reliability polynomial; (iv) duality of networks via a ...
Constantin Udriste +2 more
doaj +1 more source

