English
Related papers

Related papers: On the average value of the minimal Hamming multip…

200 papers

We use an old elementary arithmetic argument to find new upper and lower bounds for Sylvester's denumerant function. These bounds are tight enough to get the asymptotic behavior of the denumerant.

Number Theory · Mathematics 2023-01-13 Gerardo Ballesio

We study affine cartesian codes, which are a Reed-Muller type of evaluation codes, where polynomials are evaluated at the cartesian product of n subsets of a finite field F_q. These codes appeared recently in a work by H. Lopez, C.…

Information Theory · Computer Science 2013-08-27 Cicero Carvalho

For n=1,2,3,... define S(n) as the smallest integer m>1 such that those 2k(k-1) mod m for k=1,...,n are pairwise distinct; we show that S(n) is the least prime greater than 2n-2 and hence the value set of the function S(n) is exactly the…

Number Theory · Mathematics 2013-04-18 Zhi-Wei Sun

The number of parts in the partitions (resp. distinct partitions) of $n$ with parts from a set were considered. Its generating functions were obtained. Consequently, we derive several recurrence identities for the following functions: the…

Number Theory · Mathematics 2025-09-29 A. David Christopher

It is shown that for any positive integer n there exists a subnormal weighted shift on a directed tree whose nth power is closed and densely defined while its (n + 1)th power has trivial domain. Similar result for composition operators in…

Functional Analysis · Mathematics 2014-09-30 Piotr Budzynski , Zenon Jan Jablonski , Il Bong Jung , Jan Stochel

Let $L_n(k)$ denote the least common multiple of $k$ independent random integers uniformly chosen in $\{1,2,\ldots ,n\}$. In this note, using a purely probabilistic approach, we derive a criterion for the convergence in distribution as…

Probability · Mathematics 2019-11-11 Alin Bostan , Alexander Marynych , Kilian Raschel

Let $M^n\subset\mathbb R^{n+1}$ be the graph of a $C^2$-real valued function defined in a closed ball of $\mathbb R^n$. In this work, we obtain upper bounds for $\inf_M|H|$ and $\inf_M|R|$, where $H$ and $R$ are, respectively, the mean…

Differential Geometry · Mathematics 2009-08-27 Francisco Fontenele

Le n be any positive integer. A hyperbinary expansion of n is are presentation of n as sum of powers of 2, each power being used at most twice. In this paper we study some properties of a suitable edge-coloured and vertex-weighted oriented…

Combinatorics · Mathematics 2016-10-05 M. Brunetti , A. D'Aniello

We generalize the well-known mean value inequality of subharmonic functions for a slightly more general function class. We also apply this generalized mean value inequality to weighted boundary behavior and nonintegrability questions of…

Classical Analysis and ODEs · Mathematics 2007-05-23 Juhani Riihentaus

We develop a notion of {\em inner rank} as a tool for obtaining lower bounds on the rank of matrix multiplication tensors. We use it to give a short proof that the border rank (and therefore rank) of the tensor associated with $n\times n$…

Computational Complexity · Computer Science 2019-05-15 Joel Friedman

We find minimal supports of eigenfunctions of Hamming graphs for eigenvalue n(q-1)-q and describe eigenfunctions with minimal support.

Combinatorics · Mathematics 2015-12-09 Alexandr Valyuzhenich

We investigate functions with the property that for every interval, the slope at the midpoint of the interval is the same as the average slope. More generally, we find functions whose average slopes over intervals are given by the slope at…

Classical Analysis and ODEs · Mathematics 2025-07-28 Paul Carter , David Lowry-Duda

The weight of the minimum spanning tree in a complete weighted graph with random edge weights is a well-known problem. For various classes of distributions, it is proved that the weight of the minimum spanning tree tends to a constant,…

Combinatorics · Mathematics 2024-05-31 Nikita Zvonkov

The aim of this work is to give degree formulas for the generalized Hamming weights of evaluation codes and to show lower bounds for these weights. In particular, we give degree formulas for the generalized Hamming weights of…

Commutative Algebra · Mathematics 2020-05-20 Delio Jaramillo , Maria Vaz Pinto , Rafael H. Villarreal

The paper deals with some elementary problems about various mean value properties and their connections to harmonic functions and random walks.

History and Overview · Mathematics 2025-02-26 Vilmos Totik

We give an upper bound that relates the minimum weight of a nonzero componentwise product of codewords from some given number of linear codes, with the dimensions of these codes. Its shape is a direct generalization of the classical…

Information Theory · Computer Science 2016-11-18 Hugues Randriambololona

Let $g(n)$ be the largest positive integer $k$ such that there are distinct primes $p_i$ for $1\leq i\leq k$ so that $p_i |n+i$. This function is related to a celebrated conjecture of C.A. Grimm. We establish upper and lower bounds for…

Number Theory · Mathematics 2013-06-06 Shanta Laishram , Ram Murty

Inspired by the papers by Angelo and Xu, Q.J Math., 74, pp. 767-777, and improvements by Kerr and Klurman, arXiv:2211.05540, we study the probability that the weighted sums of a Rademacher random multiplicative function, $\sum_{n\leq…

Number Theory · Mathematics 2025-08-04 Marco Aymone

We study a weighted divisor function $\mathop{{\sum}'}\limits_{mn\leq x}\cos(2\pi m\theta_1)\sin(2\pi n\theta_2)$, where $\theta_i (0<\theta_i<1)$ is a rational number. By connecting it with the divisor problem with congruence conditions,…

Number Theory · Mathematics 2016-11-24 Lirui Jia , Wenguang Zhai

In this note we give a new upper bound for the Laplacian eigenvalues of an unweighted graph. Let $G$ be a simple graph on $n$ vertices. Let $d_{m}(G)$ and $\lambda_{m+1}(G)$ be the $m$-th smallest degree of $G$ and the $m+1$-th smallest…

Combinatorics · Mathematics 2011-06-07 Miriam Farber , Ido Kaminer