Christian Elsholtz

According to our database, Christian Elsholtz authored at least 14 papers between 2004 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

Large subsets of $\mathbb {Z}_m^n$ without arithmetic progressions.

Christian Elsholtz, Benjamin Klahn, Gabriel F. Lipnik

Des. Codes Cryptogr., April, 2023

2021

Fermat's Last Theorem Implies Euclid's Infinitude of Primes.

Christian Elsholtz

Am. Math. Mon., 2021

2020

Unconditional Prime-Representing Functions, Following Mills.

Christian Elsholtz

Am. Math. Mon., 2020

Caps and progression-free sets in ${{\mathbb {Z}}}_m^n$.

Christian Elsholtz, Péter Pál Pach

Des. Codes Cryptogr., 2020

2019

Algorithmic counting of nonequivalent compact Huffman codes.

Christian Elsholtz, Clemens Heuberger, Daniel Krenn

CoRR, 2019

2017

Golomb's Conjecture on Prime Gaps.

Christian Elsholtz

Am. Math. Mon., 2017

Maximal sum-free sets of integer lattice grids.

Christian Elsholtz, Laurence Rackham

J. Lond. Math. Soc., 2017

2013

The Number of Huffman Codes, Compact Trees, and Sums of Unit Fractions.

Christian Elsholtz, Clemens Heuberger, Helmut Prodinger

IEEE Trans. Inf. Theory, 2013

2012

Prime Divisors of Thin Sequences.

Christian Elsholtz

Am. Math. Mon., 2012

2011

Patterns and complexity of multiplicative functions.

Y. Buttkewitz, Christian Elsholtz

J. Lond. Math. Soc., 2011

2006

A Short Survey on Upper and Lower Bounds for Multidimensional Zero Sums.

Christian Elsholtz

Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

2005

Shifted products that are coprime pure powers.

Rainer Dietmann, Christian Elsholtz, Katalin Gyarmati, Miklós Simonovits

J. Comb. Theory, Ser. A, 2005

Maximal Dimension of Unit Simplices.

Christian Elsholtz, Walter Klotz

Discret. Comput. Geom., 2005

2004

Lower Bounds For Multidimensional Zero Sums.

Christian Elsholtz

Comb., 2004