Related papers: Block designs and prime values of polynomials

Let $f(x)\in \mathbb{Z}[x]$ be an irreducible polynomial of degree $d\ge 1$. Let $k\ge2$ be an integer. The number of integers $n$ such that $f(n)$ is $k$-free is widely studied in the literature. In principle, one expects that $f(n)$ is…

In this paper, we classify all $2$-blocks for which the defect groups are abelian and the inertial quotient has prime order. As a consequence, we prove that Brou\'e's abelian defect group conjecture holds for all blocks under consideration…

In this note we give applications of recent results coming mostly from the third paper of this series. It is shown that the number of irreducible characters in a $p$-block of a finite group with abelian defect group $D$ is bounded by $|D|$…

In the moduli space of degree d polynomials, the special subvarieties are those cut out by critical orbit relations, and then the special points are the post-critically finite polynomials. It was conjectured that in the moduli space of…

Motivated by a problem in complex dynamics, we examine the block structure of the natural action of monodromy groups on the tree of preimages of a generic point. We show that in many cases, including when the polynomial has prime power…

The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…

Let $a,b$ and $n$ be positive integers with $a>b$. In this note, we prove that $$(2bn+1)(2bn+3){2bn \choose bn}\bigg|3(a-b)(3a-b){2an \choose an}{an\choose bn}.$$ This confirms a recent conjecture of Amdeberhan and Moll.

The Bateman-Horn conjecture is a far-reaching statement about the distribution of the prime numbers. It implies many known results, such as the prime number theorem and the Green-Tao theorem, along with many famous conjectures, such the…

Schinzel's Hypothesis H is a general conjecture in number theory on prime values of polynomials that generalizes, e.g., the twin prime conjecture and Dirichlet's theorem on primes in arithmetic progression. We prove an arithmetic analog of…

If G is a finite group, we have proposed new conjectures on the interaction between different primes and their corresponding Brauer principal blocks. In this paper, we give strong support to the validity of these conjectures.

In 2007, Dmytrenko, Lazebnik and Williford posed two related conjectures about polynomials over finite fields. Conjecture~1 is a claim about the uniqueness of certain monomial graphs. Conjecture~2, which implies Conjecture~1, deals with…

We give conjectures on the possible graded Betti numbers of Cohen-Macaulay modules up to multiplication by positive rational numbers. The idea is that the Betti diagrams should be non-negative linear combinations of pure diagrams. The…

We consider polynomials of bi-degree $(n,1)$ over the skew field of quaternions where the indeterminates commute with each other and with all coefficients. Polynomials of this type do not generally admit factorizations. We recall a…

Hilbert famously showed that polynomials in n variables are not too complicated, in various senses. For example, the Hilbert Syzygy Theorem shows that the process of resolving a module by free modules terminates in finitely many (in fact,…

The two basic equations satisfied by the parameters of a block design define a three-dimensional affine variety $\mathcal{D}$ in $\mathbb{R}^{5}$. A point of $\mathcal{D}$ that is not in some sense trivial lies on four lines lying in…

Due to their important applications to coding theory, cryptography, communications and statistics, combinatorial $t$-designs have been attracted lots of research interest for decades. The interplay between coding theory and $t$-designs has…

Using the theory of Kostka polynomials, we prove an A_{n-1} version of Bailey's lemma at integral level. Exploiting a new, conjectural expansion for Kostka numbers, this is then generalized to fractional levels, leading to a new expression…

In this paper, we introduce a certain method to construct polynomials producing many absolute pseudoprimes. By this method, we give new polynomials producing absolute pseudoprimes with any fixed number of prime factors which can be viewed…

A hyperplane arrangement is said to satisfy the ``Riemann hypothesis'' if all roots of its characteristic polynomial have the same real part. This property was conjectured by Postnikov and Stanley for certain families of arrangements which…

Searching for structural reasons behind old results and conjectures of Chudnovksy regarding the least degree of a nonzero form in an ideal of fat points in projective N-space, we make conjectures which explain them, and we prove the…