Related papers: A short note on Jacobsthal's function

Minimal representations of a real reductive group G are the `smallest' irreducible unitary representations of G. We discuss special functions that arise in the analysis of L^2-model of minimal representations.

We say $G\to (\mathcal{C}, P_n)$ if $G-E(F)$ contains an $n$-vertex path $P_n$ for any spanning forest $F\subset G$. The size Ramsey number $\hat{R}(\mathcal{C}, P_n)$ is the smallest integer $m$ such that there exists a graph $G$ with $m$…

The minimal excludant of a partition $\lambda$, $\rm{mex}(\lambda)$, is the smallest positive integer that is not a part of $\lambda$. For a positive integer $n$, $ \sigma\, \rm{mex}(n)$ denotes the sum of the minimal excludants of all…

For a function $g:\N\to \N$, the \emph{$g$-regressive Ramsey number} of $k$ is the least $N$ so that \[N\stackrel \min \longrightarrow (k)_g\] . This symbol means: for every $c:[N]^2\to \N$ that satisfies $c(m,n)\le g(\min\{m,n\})$ there is…

It is shown that, for any function $g$ that is weakly increasing on compact convex sets and has the property that if $\lambda\ge 0$ and $K^\prime$ is a translate of $\lambda K$ then $g(K^\prime) =\lambda g(K)$, then for any covering…

Let $G$ be a finite abelian group and let $\varnothing \neq A \subset \mathbb Z$. The $A$-weighted Davenport constant of $G$ is the smallest positive integer ${\sf D}_A(G)$ such that every sequence $x_1 \boldsymbol{\cdot} {\dots}…

It is shown that the finite dimensional irreducible representations of the quantum matrix algebra $ M_q(n) $ ( the coordinate ring of $ GL_q(n) $ ) exist only when q is a root of unity ( $ q^p = 1 $ ). The dimensions of these…

For a positive integer $n$, let $\mathcal T(n)$ be the set of all integers greater than or equal to $n$. An integral quadratic form $f$ is called tight $\mathcal T(n)$-universal if the set of nonzero integers that are represented by $f$ is…

Let $G$ be an additive finite abelian group and let $k\in [\exp(G),\mathsf{D}(G)-1]$ be a positive integer. Denote by $\mathsf{s}_{\leq k}(G)$ the smallest positive integer $l\in \mathbb{N}\cup \{+\infty\}$ such that each sequence of length…

The purpose of this short communication is to make some observations on the connections between various existing formulas of counting the number of sublattices of a fixed index in an $n$-dimensional lattice and their connection with the…

A vertex set $D$ of a graph $G$ is said to be a dominating set if every vertex of $V(G)\setminus D$ is adjacent to at least a vertex in $D$, and the domination number $\gamma(G)$ ($\gamma$, for short) is the minimum cardinality of all…

Let A be a set of integers and let h \geq 2. For every integer n, let r_{A, h}(n) denote the number of representations of n in the form n=a_1+...+a_h, where a_1,...,a_h belong to the set A, and a_1\leq ... \leq a_h. The function r_{A,h}…

The number of perfect matchings of a $k$-pfaffian graph can be counted by computing a linear combination of the pfaffians of $k$ matrices. The pfaffian number of a graph $G$ is the smallest integer $k$ such that $G$ is $k$-pfaffian. We…

Let $p$ and $q$ be two distinct fixed prime numbers and $(n_i)_{i\geq 0}$ the sequence of consecutive integers of the form $p^a\cdot q^b$ with $a,b\ge 0$. Tijdeman gave a lower bound (1973) and an upper bound (1974) for the gap size…

A parking function of length n is a sequence (b_1, b_2,..., b_n) of nonnegative integers whose nondecreasing rearrangement (a_1, a_2,...,a_n) has the property that a_i < i for every i. A well-known result about parking functions is that the…

We examine the open problem of finding the shortest string that contains each of the n! permutations of n symbols as contiguous substrings (i.e., the shortest superpermutation on n symbols). It has been conjectured that the shortest…

In this article we estimate the number of integers up to $X$ which can be represented by a positive-definite, binary integral quadratic form of discriminant which is small relative to $X$. This follows from understanding the vector of signs…

Let $n,r,k,s$ be positive integers with $n,k\ge 2$. The generalized Ramsey number $R(n,r;k,s)$ is the smallest positive integer $p$ such that for every graph $G$ of order $p$, either $G$ contains a subgraph induced by $n$ vertices with at…

Let $G(k)$ denote the least number $s$ having the property that every sufficiently large natural number is the sum of at most $s$ positive integral $k$-th powers. Then for all $k\in \mathbb N$, one has \[ G(k)\le \lceil k(\log…

Let $G$ be a reductive algebraic group over $\mathbb{Q}$ and $\Gamma\subset G(\mathbb{Q})$ an arithmetic subgroup. Let $K_\infty\subset G(\mathbb{R})$ be a maximal compact subgroup. We study the asymptotic behavior of the counting functions…