Related papers: Block designs and prime values of polynomials

In this paper we prove the Gromov--Milman conjecture (the Dvoretzky type theorem) for homogeneous polynomials on $\mathbb R^n$, and improve bounds on the number $n(d,k)$ in the analogous conjecture for odd degrees $d$ (this case is known as…

Delandtsheer and Doyen bounded, in terms of the block size, the number of points of a point-imprimitive, block-transitive 2-design. To do this they introduced two integer parameters, m and n, now called Delandtsheer--Doyen parameters,…

We consider polynomials which take integer values on the integers (IVPs), and satisfy an additional growth condition on the natural numbers. Elkies and Speyer, answering a question by Dimitrov, showed there is a critical exponential growth…

We prove some trigonometric identities involving Chebyshev polynomials of second kind. The identities were inspired by atomic form factor calculations. Generalizations of these identities, if found, will help to increase the numerical…

Let $F_q$ be a field with $q$ elements, where $q$ is a power of a prime number $p\geq 5$. For any integer $m\geq 2$ and $a\in F_q^*$ such that the polynomial $x^m-a$ is irreducible in $F_q[x]$, we combine two different methods to construct…

Let $K=\mathbb{Q}(\omega)$ with $\omega$ the root of a degree $n$ monic irreducible polynomial $f\in\mathbb{Z}[X]$. We show the degree $n$ polynomial $N(\sum_{i=1}^{n-k}x_i\omega^{i-1})$ in $n-k$ variables formed by setting the final $k$…

It is shown that the values of Sylvester type determinants for various orthogonal polynomials considered by Askey in [R.Askey, Evaluation of some determinants, Proceedings of the 4th ISAAC Congress, 200x, xxx-xxx] can be ascertained…

Consider representation theory associated to symmetric groups, or to Hecke algebras in type A, or to q-Schur algebras, or to finite general linear groups in non-describing characteristic. Rock blocks are certain combinatorially defined…

We obtain explicit upper bounds for the number of irreducible factors for a class of compositions of polynomials in several variables over a given field. In particular, some irreducibility criteria are given for this class of compositions…

We propose a new construction of two-dimensional natural bi-Hamiltonian systems associated with a very simple Lie algebra. The presented construction allows us to distinguish three families of super-integrable monomial potentials for which…

We study integer-valued matrices with bounded determinants. Such matrices appear in the theory of integer programs (IP) with bounded determinants. For example, Artmann et al. showed that an IP can be solved in strongly polynomial time if…

In this paper we extend the block combinatorics partition theorems of Hindman and Milliken in the setting of the recursive system of the block Schreier families (B^xi) consisting of families defined for every countable ordinal xi. Results…

We give a construction that in many cases gives a simple way to construct infinite families of algebras that are not Morita equivalent, but are all derived equivalent to the same block algebra of a finite group, and apply it to some small…

A classic result of Ritt describes polynomials invertible in radicals: they are compositions of power polynomials, Chebyshev polynomials and polynomials of degree at most 4. In this paper we prove that a polynomial invertible in radicals…

This paper investigates the Brennan Conjecture for domains $\Omega$ that arise as basins of attraction of a polynomial. We extend the result of Baranski, Volberg, and Zdunik to a broader class of polynomials. We prove that for any monic…

We study how often exceptional configurations of irreducible polynomials over finite fields occur in the context of prime number races and Chebyshev's bias. In particular, we show that three types of biases, which we call "complete bias",…

Recently, Kim-Jang-Yi have introduced q-Bernstein polynomials. From these q-Berstein polynomials, we investigte some properties related to q-Stirling numbes and q-Bernoulli numbes.

In this paper, we make some conjectures on prime numbers that are sharper than those found in the current literature. First we describe our studies on Legendre's Conjecture which is still unsolved. Next, we show that Brocard's Conjecture…

In this paper, we introduce the notion of Jacobi polynomials with multiple reference vectors of a code, and give the MacWilliams type identity for it. Moreover, we derive a formula to obtain the Jacobi polynomials using the Aronhold…

Given any positive integer $n,$ let $A(n)$ denote the height of the $n^{\text{th}}$ cyclotomic polynomial, that is its maximum coefficient in absolute value. It is well known that $A(n)$ is unbounded. We conjecture that every natural number…