Christian Elsholtz

Orcid: 0000-0002-2960-4030

According to our database1, Christian Elsholtz authored at least 14 papers between 2004 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Algorithmic counting of nonequivalent compact Huffman codes.
Appl. Algebra Eng. Commun. Comput., November, 2024

2023
Large subsets of $\mathbb {Z}_m^n$ without arithmetic progressions.
Des. Codes Cryptogr., April, 2023

2021
Fermat's Last Theorem Implies Euclid's Infinitude of Primes.
Am. Math. Mon., 2021

2020
Unconditional Prime-Representing Functions, Following Mills.
Am. Math. Mon., 2020

Caps and progression-free sets in ${{\mathbb {Z}}}_m^n$.
Des. Codes Cryptogr., 2020

2017
Golomb's Conjecture on Prime Gaps.
Am. Math. Mon., 2017

Maximal sum-free sets of integer lattice grids.
J. Lond. Math. Soc., 2017

2013
The Number of Huffman Codes, Compact Trees, and Sums of Unit Fractions.
IEEE Trans. Inf. Theory, 2013

2012
Prime Divisors of Thin Sequences.
Am. Math. Mon., 2012

2011
Patterns and complexity of multiplicative functions.
J. Lond. Math. Soc., 2011

2006
A Short Survey on Upper and Lower Bounds for Multidimensional Zero Sums.
Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

2005
Shifted products that are coprime pure powers.
J. Comb. Theory A, 2005

Maximal Dimension of Unit Simplices.
Discret. Comput. Geom., 2005

2004
Lower Bounds For Multidimensional Zero Sums.
Comb., 2004


  Loading...