On the Frobenius number of a proportionally modular Diophantine inequality.
Delgado, M., Rosales, J.C. (2006)
Portugaliae Mathematica. Nova Série
Similarity:
Displaying similar documents to “On the Frobenius number of a modular Diophantine inequality”
On the Frobenius number of a proportionally modular Diophantine inequality.
A Classical Diophantine Problem and Modular Forms of Weight 3/2.
J.B. Tunnell (1983)
Inventiones mathematicae
Similarity:
The Frobenius number of geometric sequences.
Ong, Darren C., Ponomarenko, Vadim (2008)
Integers
Similarity:
Numerical semigroups with a monotonic Apéry set
José Carlos Rosales, Pedro A. García-Sánchez, Juan Ignacio García-García, M. B. Branco (2005)
Czechoslovak Mathematical Journal
Similarity:
We study numerical semigroups with the property that if is the multiplicity of and is the least element of congruent with modulo , then . The set of numerical semigroups with this property and fixed multiplicity is bijective with an affine semigroup and consequently it can be described by a finite set of parameters. Invariants like the gender, type, embedding dimension and Frobenius number are computed for several families of this kind of numerical semigroups.
On a generalization of the coin exchange problem for three variables.
Tripathi, Amitabha, Vijay, Sujith (2006)
Journal of Integer Sequences [electronic only]
Similarity:
Integral points of a modular curve of level 11
René Schoof, Nikos Tzanakis (2012)
Acta Arithmetica
Similarity:
Modular equations for some η-products
(2013)
Acta Arithmetica
Similarity:
The classical modular equations involve bivariate polynomials that can be seen to be univariate in the modular invariant j with integer coefficients. Kiepert found modular equations relating some η-quotients and the Weber functions γ₂ and γ₃. In the present work, we extend this idea to double η-quotients and characterize all the parameters leading to this kind of equation. We give some properties of these equations, explain how to compute them and give numerical examples.