Motivic L-functions and Galois module structures.
Mots infinis et produits de matrices a coefficients polynomiaux
Motzkin numbers, central trinomial coefficients and hybrid polynomials.
Motzkin numbers of higher rank: generating function and explicit expression.
Motzkin paths and powers of continued fractions.
Multi-continued fraction algorithm on multi-formal Laurent series
Multi-covering radius for rank metric codes.
Multidimensional covering systems of congruences
Multidimensional Euclidean algorithms.
Multidimensional Gauss reduction theory for conjugacy classes of
In this paper we describe the set of conjugacy classes in the group . We expand geometric Gauss Reduction Theory that solves the problem for to the multidimensional case, where -reduced Hessenberg matrices play the role of reduced matrices. Further we find complete invariants of conjugacy classes in in terms of multidimensional Klein-Voronoi continued fractions.
Multidimensional reciprocity laws.
Multigeometric sequences and Cantorvals
For a sequence x ∈ l 10, one can consider the achievement set E(x) of all subsums of series Σn=1∞ x(n). It is known that E(x) has one of the following structures: a finite union of closed intervals, a set homeomorphic to the Cantor set, a set homeomorphic to the set T of subsums of Σn=1∞ x(n) where c(2n − 1) = 3/4n and c(2n) = 2/4n (Cantorval). Based on ideas of Jones and Velleman [Jones R., Achievement sets of sequences, Amer. Math. Monthly, 2011, 118(6), 508–521] and Guthrie and Nymann [Guthrie...
Multi-parametric extensions of Newman's phenomenon.
Multiple binomial transforms and families of integer sequences.
Multiple convolution formulae on classical combinatorial numbers.
Multiple Dirichlet series over rational function fields
Multiple exponential sums with monomials
Multiple finite Riemann zeta functions
Multiple gcd-closed sets and determinants of matrices associated with arithmetic functions
Let f be an arithmetic function and S = {x1, …, xn} be a set of n distinct positive integers. By (f(xi, xj)) (resp. (f[xi, xj])) we denote the n × n matrix having f evaluated at the greatest common divisor (xi, xj) (resp. the least common multiple [xi, xj]) of x, and xj as its (i, j)-entry, respectively. The set S is said to be gcd closed if (xi, xj) ∈ S for 1 ≤ i, j ≤ n. In this paper, we give formulas for the determinants of the matrices (f(xi, xj)) and (f[xi, xj]) if S consists of multiple coprime...
Multiple Lattice Packings and Coverings of Spheres.