Artin's primitive root conjecture for function fields revisited

Artin's primitive root conjecture for function fields was proved by Bilharz in his thesis in 1937, conditionally on the proof of the Riemann hypothesis for function fields over finite fields, which was proved later by Weil in 1948. In this paper, we provide a simple proof of Artin's primitive root conjecture for function fields which does not use the Riemann hypothesis for function fields but rather modifies the classical argument of Hadamard and de la Vallée Poussin in their 1896 proof of the prime number theorem.     

The Arc‐Weighted Version of the Second Neighborhood Conjecture

Seymour conjectured that every oriented simple graph contains a vertex whose second neighborhood is at least as large as its first. Seymour's conjecture has been verified in several special cases, most notably for tournaments by Fisher  6 . One extension of the conjecture that has been used by several researchers is to consider vertex‐weighted digraphs. In this article we introduce a version of the conjecture for arc‐weighted digraphs. We prove the conjecture in the special case of arc‐weighted tournaments, strengthening Fisher's theorem. Our proof does not rely on Fisher's result, and thus can be seen as an alternate proof of said theorem.     

Alternating sums over π-subgroups

Dade's conjecture predicts that if p is a prime, then the number of irreducible characters of a finite group of a given p-defect is determined by local subgroups. In this paper we replace p by a set of primes π and prove a π-version of Dade's conjecture for π-separable groups. This extends the (known) p-solvable case of the original conjecture and relates to a π-version of Alperin's weight conjecture previously established by the authors.     

Classifying planar monomials over fields of order a prime cubed

Using Hermite's criteria, we classify planar monomials over fields of order a prime cubed, establishing the Dembowski-Ostrom conjecture for monomials over fields of such orders.     

Entiers Lexicographiques

An integer n is called lexicographic if the increasing sequence of its divisors, regarded as words on the (finite) alphabet of the prime factors (arranged in increasing size), is ordered lexicographically. This concept easily yields to a new type of multiplicative structure for the exceptional set in the Maier-Tenenbaum theorem on the propinquity of divisors, which settled a well-known conjecture of Erdös. We provide asymptotic formulae for the number of lexicographic integers not exceeding a given limit, as well as for certain arithmetically weighted sums over the same set. These results are subsequently applied to establishing an Erdös-Kac theorem with remainder for the distribution of the number of prime factors over lexicographic integers. This provides quantitative estimates for lexicographical exceptions to Erdos' conjecture that also satisfy the Hardy-Ramanujan theorem.     

Fair reception and Vizing's conjecture

In this paper we introduce the concept of fair reception of a graph which is related to its domination number. We prove that all graphs G with a fair reception of size γ(G) satisfy Vizing's conjecture on the domination number of Cartesian product graphs, by which we extend the well‐known result of Barcalkin and German concerning decomposable graphs. Combining our concept with a result of Aharoni, Berger and Ziv, we obtain an alternative proof of the theorem of Aharoni and Szabó that chordal graphs satisfy Vizing's conjecture. A new infinite family of graphs that satisfy Vizing's conjecture is also presented. © 2009 Wiley Periodicals, Inc. J Graph Theory 61: 45‐54, 2009     

Variations of Rado's lemma

The deductive strengths of three variations of Rado's selection lemma are studied in set theory without the axiom of choice. Two are shown to be equivalent to Rado's lemma and the third to the Boolean prime ideal theorem. MSC: 03E25, 04A25, 06E05.     

The Bateman–Horn conjecture: Heuristic,history, and applications

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 twin prime conjecture and Landau’s conjecture. We discuss the Bateman–Horn conjecture, its applications, and its origins.     

Un théorème du point fixe de Lefschetz en géométrie d'Arakelov

We consider arithmetic varieties endowed with an action of the group scheme of n-th roots of unity and we define equivariant arithmetic K₀-theory for these varieties. We then state a Riemann-Roch theorem for the natural transformation of equivariant arithmetic K₀ -theory induced by the restriction to the fixed point scheme and we show that it implies a version of Bismut's conjecture of an equivariant arithmetic Riemann-Roch theorem.     

Cyclotomy and its application to duadic codes

In this paper we treat cyclotomic binary duadic codes. The conjecture of Ding and Pless is that there are infinitely many cyclotomic duadic codes of prime lengths that are not quadratic residue codes. We shall prove this conjecture by using the special case of Tschebotareff's density theorem.     

On the theorem of Barban and Davenport-Halberstam in algebraic number fields

The Barban-Davenport-Halberstam theorem is generalized to arbitrary algebraic number fields of finite degree over the rationals. As an application, we consider a divisor problem and a result of Elliott and Halberstam concerning the least prime in an arithmetic progression.     

Effective Estimates on Integral Quadratic Forms: Masser’s Conjecture,Generators of Orthogonal Groups,and Bounds in Reduction Theory

In this paper we prove a conjecture of David Masser on small height integral equivalence between integral quadratic forms. Using our resolution of Masser’s conjecture we show that integral orthogonal groups are generated by small elements which is essentially an effective version of Siegel’s theorem on the finite generation of these groups. We also obtain new estimates on reduction theory and representation theory of integral quadratic forms. Our line of attack is to make and exploit the connections between certain problems about quadratic forms and group actions, whence we may study the problem in the well-developed theory of homogeneous dynamics, arithmetic groups, and the spectral theory of automorphic forms.     

Dade's Invariant Conjecture for the Symplectic Group Sp4(2 n ) and the Special Unitary Group SU4(22n ) in Defining Characteristic

In this article, we verify Dade's projective invariant conjecture for the symplectic group Sp₄(2 ⁿ ) and the special unitary group SU₄(2²ⁿ ) in the defining characteristic, that is, in characteristic 2. Furthermore, we show that the Isaacs–Malle–Navarro version of the McKay conjecture holds for Sp₄(2 ⁿ ) and SU₄(2²ⁿ ) in the defining characteristic, that is, Sp₄(2 ⁿ ) and SU₄(2²ⁿ ) are good for the prime 2 in the sense of Isaacs, Malle, and Navarro.     

On topological set theory

This paper is concerned with topological set theory, and particularly with Skala's and Manakos' systems for which we give a topological characterization of the models. This enables us to answer natural questions about those theories, reviewing previous results and proving new ones. One of these shows that Skala's set theory is in a sense compatible with any ‘normal’ set theory, and another appears on the semantic side as a ‘Cantor theorem’ for the category of Alexandroff spaces. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Vaught's Conjecture and Group Rings

We discuss Vaught's conjecture for complete theories of modules over some group rings over the integers and other Dedekind domains, and over pullback rings of Dedekind domains.     

Vizing's conjecture: a survey and recent results

Vizing's conjecture from 1968 asserts that the domination number of the Cartesian product of two graphs is at least as large as the product of their domination numbers. In this paper we survey the approaches to this central conjecture from domination theory and give some new results along the way. For instance, several new properties of a minimal counterexample to the conjecture are obtained and a lower bound for the domination number is proved for products of claw‐free graphs with arbitrary graphs. Open problems, questions and related conjectures are discussed throughout the paper. © 2011 Wiley Periodicals, Inc. J Graph Theory 69: 46–76, 2012     

Homological symbols and the Quillen conjecture

We formulate a “correct” version of the Quillen conjecture on linear group homology for certain arithmetic rings and provide evidence for the new conjecture. In this way we predict that the linear group homology has a direct summand looking like an unstable form of Milnor K-theory and we call this new theory “homological symbols algebra”. As a byproduct, we prove the Quillen conjecture in homological degree two for the rank two and the prime 5.     

On matrix analogs of Fermat’s little theorem

The theorem proved in this paper gives a congruence for the traces of powers of an algebraic integer for the case in which the exponent of the power is a prime power. The theorem implies a congruence in Gauss’ form for the traces of the sums of powers of algebraic integers, generalizing many familiar versions of Fermat’s little theorem. Applied to the traces of integer matrices, this gives a proof of Arnold’s conjecture about the congruence of the traces of powers of such matrices for the case in which the exponent of the power is a prime power.     

A new approach to constant term identities and Selberg-type integrals

Selberg-type integrals that can be turned into constant term identities for Laurent polynomials arise naturally in conjunction with random matrix models in statistical mechanics. Built on a recent idea of Karasev and Petrov we develop a general interpolation based method that is powerful enough to establish many such identities in a simple manner. The main consequence is the proof of a conjecture of Forrester related to the Calogero–Sutherland model. In fact we prove a more general theorem, which includes Aomoto's constant term identity at the same time. We also demonstrate the relevance of the method in additive combinatorics.     

Abelian groups and quadratic residues in weak arithmetic

We investigate the provability of some properties of abelian groups and quadratic residues in variants of bounded arithmetic. Specifically, we show that the structure theorem for finite abelian groups is provable in S₂² + iWPHP(Σ₁^b), and use it to derive Fermat's little theorem and Euler's criterion for the Legendre symbol in S₂² + iWPHP(PV) extended by the pigeonhole principle PHP(PV). We prove the quadratic reciprocity theorem (including the supplementary laws) in the arithmetic theories T₂⁰ + Count₂(PV) and I Δ₀ + Count₂(Δ₀) with modulo‐2 counting principles (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)