Page 1 Next

## Displaying 1 – 20 of 349

Showing per page

### A basis for the ring of doubly integer-valued polynomials.

Journal für die reine und angewandte Mathematik

### A characterization of partition polynomials and good Bernoulli trial measures in many symbols

Colloquium Mathematicae

Consider an experiment with d+1 possible outcomes, d of which occur with probabilities $x₁,...,{x}_{d}$. If we consider a large number of independent occurrences of this experiment, the probability of any event in the resulting space is a polynomial in $x₁,...,{x}_{d}$. We characterize those polynomials which arise as the probability of such an event. We use this to characterize those x⃗ for which the measure resulting from an infinite sequence of such trials is good in the sense of Akin.

### A class of irreducible polynomials

Colloquium Mathematicae

Let $f\left(x\right)=xⁿ+{k}_{n-1}{x}^{n-1}+{k}_{n-2}{x}^{n-2}+\cdots +k₁x+k₀\in ℤ\left[x\right]$, where $3\le {k}_{n-1}\le {k}_{n-2}\le \cdots \le k₁\le k₀\le 2{k}_{n-1}-3$. We show that f(x) and f(x²) are irreducible over ℚ. Moreover, the upper bound of $2{k}_{n-1}-3$ on the coefficients of f(x) is the best possible in this situation.

### A class of polynomials

Mathematica Slovaca

### A dynamical interpretation of the global canonical height on an elliptic curve.

Experimental Mathematics

Integers

Acta Arithmetica

### A generalization of a theorem of Schinzel

Colloquium Mathematicae

We give lower bounds for the Mahler measure of totally positive algebraic integers. These bounds depend on the degree and the discriminant. Our results improve earlier ones due to A. Schinzel. The proof uses an explicit auxiliary function in two variables.

Acta Arithmetica

Integers

### A matrix inequality for Möbius functions.

JIPAM. Journal of Inequalities in Pure &amp; Applied Mathematics [electronic only]

### A new exceptional polynomial for the integer transfinite diameter of $\left[0,1\right]$

Journal de théorie des nombres de Bordeaux

Using refinement of an algorithm given by Habsieger and Salvy to find integer polynomials with smallest sup norm on [0, 1] we extend their table of polynomials up to degree 100. For the degree 95 we find a new exceptionnal polynomial which has complex roots. Our method uses generalized Müntz-Legendre polynomials. We improve slightly the upper bound for the integer transfinite diameter of [0, 1] and give elementary proofs of lower bounds for the exponents of some critical polynomials.

### A Note on Eisenstein΄s Criterion

Δελτίο της Ελληνικής Μαθηματικής Εταιρίας

### A note on Krawtchouk polynomials and Riordan arrays.

Journal of Integer Sequences [electronic only]

### A note on polynomial cycles

Acta Mathematica et Informatica Universitatis Ostraviensis

### A note on the limit points associated withthe generalized abc-conjecture for ℤ[t]

Colloquium Mathematicae

### A note on the number of zeros of polynomials in an annulus

Annales Polonici Mathematici

Let p(z) be a polynomial of the form $p\left(z\right)={\sum }_{j=0}^{n}{a}_{j}{z}^{j}$, ${a}_{j}\in -1,1$. We discuss a sufficient condition for the existence of zeros of p(z) in an annulus z ∈ ℂ: 1 - c < |z| < 1 + c, where c > 0 is an absolute constant. This condition is a combination of Carleman’s formula and Jensen’s formula, which is a new approach in the study of zeros of polynomials.

Acta Arithmetica

### A paintability version of the combinatorial Nullstellensatz, and list colorings of $k$-partite $k$-uniform hypergraphs.

The Electronic Journal of Combinatorics [electronic only]

Acta Arithmetica

Page 1 Next