Lower bounds for the conductor of L-functions
J. Kaczorowski, A. Perelli (2012)
Acta Arithmetica
Similarity:
J. Kaczorowski, A. Perelli (2012)
Acta Arithmetica
Similarity:
Olivier Ramaré (2001)
Acta Arithmetica
Similarity:
L. Gajek (1987)
Applicationes Mathematicae
Similarity:
Kulikov, A.S., Fedin, S.S. (2004)
Zapiski Nauchnykh Seminarov POMI
Similarity:
Markov, Minko, Haralampiev, Vladislav, Georgiev, Georgi (2015)
Serdica Journal of Computing
Similarity:
We investigate a recently introduced width measure of planar shapes called sweepwidth and prove a lower bound theorem on the sweepwidth.
Tsz Ho Chan (2006)
Acta Arithmetica
Similarity:
P. G. Walsh (2007)
Acta Arithmetica
Similarity:
A. Adamus (1970)
Annales Polonici Mathematici
Similarity:
King, Oliver D. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
B. Chazelle, M. Sharir, J. Matousek (1995)
Discrete & computational geometry
Similarity:
Bogdanova, Galina (2000)
Serdica Mathematical Journal
Similarity:
This work was partially supported by the Bulgarian National Science Fund under Grant I–618/96. Optimal ternary constant-weight lexicogarphic codes have been constructed. New bounds for the maximum size of ternary constant-weight codes are obtained. Tables of bounds on A3 (n, d, w) are given for d = 3, 4, 6.
Al-Refai, Mohammed, Katatbeh, Qutaibeh (2006)
International Journal of Mathematics and Mathematical Sciences
Similarity:
C. Das, G. Patel (1988)
Matematički Vesnik
Similarity:
V. Lakshmikantham, S. Leela (1983)
Annales Polonici Mathematici
Similarity:
Manzini, Giovanni (1998)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity: