相关论文: Some Elementary Congruences for the Number of Weig…

A composite number $n$ is called a Lehmer number when $\phi(n) | n - 1$, where $\phi$ is the Euler totient function. Lehmer's totient problem asks if there exist any composite numbers $n$ such that $\phi(n)| n-1$? No such numbers are known.…

For nonempty sets $A,B$ of nonnegative integers and an integer $n$, let $r_{A,B}(n)$ be the number of representations of $n$ as $a+b$ and $d_{A,B}(n)$ be the number of representations of $n$ as $a-b$, where $a\in A, b\in B$. In this paper,…

We consider the problem of characterizing all functions $f$ defined on the set of integers modulo $n$ with the property that an average of some $n$th roots of unity determined by $f$ is always an algebraic integer. Examples of such…

A classical theorem of Kempner states that the sum of the reciprocals of positive integers with missing decimal digits converges. This result is extended to much larger families of "missing digits" sets of positive integers with convergent…

This article studies sums over all compositions of an integer. We derive a generating function for this quantity, and apply it to several special functions, including various generalized Bernoulli numbers. We connect composition sums with a…

Let $n$ and $k$ be integers such that $1\le k\le n$ and $f(x)$ be a nonzero polynomial of integer coefficients such that $f(m)\ne 0$ for any positive integer $m$. For any $k$-tuple $\vec{s}=(s_1, ..., s_k)$ of positive integers, we define…

We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…

Fix a positive integer $N$. Select an additive composition $\xi$ of $N$ uniformly out of $2^{N-1}$ possibilities. The interplay between the number of parts in $\xi$ and the maximum part in $\xi$ is our focus. It is not surprising that…

We study compositions of a positive integer $n$ in which the occurrence of even parts larger than a fixed threshold $k$ is controlled. More precisely, for each composition $m=(m_1,\dots,m_r)$ we consider the number of even parts strictly…

We give a generating function for the number of graphs with given numerical properties and prescribed weighted number of connected components. As an application, we give a generating function for the number of bipartite graphs of given…

The f-invariant is an injective homomorphism from the 2-line of the Adams-Novikov spectral sequence to a group which is closely related to divided congruences of elliptic modular forms. We compute the f-invariant for two infinite families…

A $\Bbbk$-configuration is a set of points $\mathbb{X}$ in $\mathbb{P}^2$ that satisfies a number of geometric conditions. Associated to a $\Bbbk$-configuration is a sequence $(d_1,\ldots,d_s)$ of positive integers, called its type, which…

Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…

Integer partitions express the different ways that a positive integer may be written as a sum of positive integers. Here we explore the analytic properties of a new polynomial $f_\lambda(x)$ that we call the partition polynomial for the…

In this paper, we study the "sum composition problem" between two lists $A$ and $B$ of positive integers. We start by saying that $B$ is "sum composition" of $A$ when there exists an ordered $m$-partition $[A_1,\ldots,A_m]$ of $A$ where $m$…

Suppose that $k$ is a non-negative integer and a bipartite multigraph $G$ is the union of $$N=\left\lfloor \frac{k+2}{k+1}n\right\rfloor -(k+1)$$ matchings $M_1,\dots,M_N$, each of size $n$. We show that $G$ has a rainbow matching of size…

A palindromic composition of $n$ is a composition of $n$ which can be read the same way forwards and backwards. In this paper we define an anti-palindromic composition of $n$ to be a composition of $n$ which has no mirror symmetry amongst…

The chromatic polynomial $\pi_{G}(k)$ of a graph $G$ can be viewed as counting the number of vertices in a family of coloring graphs $\mathcal C_k(G)$ associated with (proper) $k$-colorings of $G$ as a function of the number of colors $k$.…

A beautiful theorem of Zeckendorf states that every integer can be written uniquely as the sum of non-consecutive Fibonacci numbers $\{ F_i \}_{i = 1}^{\infty}$. A set $S \subset \mathbb{Z}$ is said to satisfy Benford's law if the density…

For a natural number $k>1$, let $f_k(n)$ denote the number of distinct representations of a natural number $n$ of the form $p^k+q^k$ for primes $p,q$. We prove that, for all $k>1$, $$\limsup_{n\to\infty}f_k(n)=\infty.$$ This positively…