Results 21 to 30 of about 3,709,601 (369)
Computing a Solution of Feigenbaum's Functional Equation in Polynomial Time [PDF]
Logical Methods in Computer Science, 2014 Lanford has shown that Feigenbaum's functional equation has an analytic solution. We show that this solution is a polynomial time computable function. This implies in particular that the so-called first Feigenbaum constant is a polynomial time computable
Peter Hertling, Christoph Spandl
doaj +1 more source
On a Linear Program for Minimum-Weight Triangulation [PDF]
, 2013 Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of effective polynomial- time heuristics that, for many instances, can find the exact MWT.
Arman Yousefi +15 more
core +3 more sources
Dwork's congruences for the constant terms of powers of a Laurent polynomial [PDF]
, 2013 We prove that the constant terms of powers of a Laurent polynomial satisfy certain congruences modulo prime powers. As a corollary, the generating series of these numbers considered as a function of a p-adic variable satisfies a non-trivial analytic ...
A. Mellit, Masha Vlasenko
semanticscholar +1 more source
Constant terms in powers of a Laurent polynomial
Indagationes Mathematicae, 1998 The following is a conjecture of O. Mathieu: Let \(K\) be a connected real compact Lie group. Let \(f\) and \(g\) be \(K\)-finite functions on \(K\). Assume for all \(n \geq 1\) that the constant term of \(f^{n}\) vanishes, i.e. \[ \int_{K} f^{n}(k) \;dk = 0 .
Duistermaat, J.J., Kallen, W. van der
openaire +3 more sources
Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor [PDF]
JACM, 2010 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
On the generalized Davenport constant and the Noether number [PDF]
, 2013 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
Hamming distance from irreducible polynomials over $\mathbb {F}_2$ [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 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
Degree estimates for polynomials constant on a hyperplane
Michigan Mathematical Journal, 2007 The study of proper rational mappings between balls in complex Euclidean spaces naturally leads to the relationship between the degree and imbedding dimension of such a mapping. The special case for monomial mappings is equivalent to the question discussed in this paper. Estimate the degree $d$ of a polynomial in $n$ real variables, assumed to have non-
D'Angelo, John +2 more
openaire +3 more sources
Zeros of Fekete polynomials [PDF]
, 1999 The authors study the distribution of zeros of the Fekete polynomial f_p(t) (defined for p prime) as p -> infinity. They show that asymptotically a constant fraction of the zeros lie on the unit circle, and they investigate the constant of ...
Conrey, J. Brian +3 more
core +3 more sources