相关论文: The Chung-Graham Expansion

For a fixed integer $k \ge 0$, consider representations of positive integers as sums of binomial coefficients of the form $\binom{n}{k}$. While exact minimal bounds for the number of required summands are known only in a few low-dimensional…

To represent positive integers by regular patterns on a plane or in three-dimensional space may be traced back to the Pythagoreans. The aim of the present article is to explore the possibility of extending the representation framework for…

The Choi representation of completely positive (CP) maps, i.e. quantum channels is often used in the context of quantum information and computation as it is easy to work with. It is a correspondence between CP maps and quantum states also…

We help Alice play a certain "convergence game" against Bob and win the prize, which is a constructive solution to a problem by Erd\H{o}s and Graham, posed in their 1980 book on open questions in combinatorial number theory. Namely, after…

For each integer $d\ge 4$, we study the sequence of positive integers which are represented by one at least of the cyclotomic binary forms $\Phi_n(X,Y)$, with $n$ a positive integer satisfying $\varphi(n)\ge d$. The case $d=2$ was studied…

Let $F_1=1,F_2=1,\ldots$ be the Fibonacci sequence. Motivated by the identity $\displaystyle\sum_{k=0}^{\infty}\frac{1}{F_{2^k}}=\frac{7-\sqrt{5}}{2}$, Erd\"os and Graham asked whether $\displaystyle\sum_{k=1}^{\infty}\frac{1}{F_{n_k}}$ is…

We use elementary arguments to prove results on the order of magnitude of certain sums concerning the gcd's and lcm's of $k$ positive integers, where $k\ge 2$ is fixed. We refine and generalize an asymptotic formula of Bordell\`{e}s (2007),…

The equivalence problem for unambiguous grammars is an important, but very difficult open question in formal language theory. Consider the \emph{limited} equivalence problem for unambiguous grammars -- for two unambiguous grammars $G_1$ and…

In this paper, we obtain formulas for the number of representations of positive integers as sums of arbitrarily many squares (and other polygonal numbers) with a certain natural weighting. The resulting weighted sums give Fourier…

The pseudo-Gamma function is a key tool introduced recently by Cheng and Albeverio in the proof of \break the density hypothesis. This function is doubly symmetric, which means that it is reflectively symmetric about the real axis by the…

By studying Cameron's operator in terms of determinants, two kinds of "integer" sequences of incomplete numbers were introduced. One was the sequence of restricted numbers, including $s$-step Fibonacci sequences. Another was the sequence of…

The aim of this note is to survey the factorizations of the Fibonacci infinite word that make use of the Fibonacci words and other related words, and to show that all these factorizations can be easily derived in sequence starting from…

We investigate generalized quadratic forms with values in the set of rational integers over quadratic fields. We characterize the real quadratic fields which admit a positive definite binary generalized form of this type representing every…

We classify extensions of certain classifiable C*-algebras using the six term exact sequence in K-theory together with the positive cone of the K_0-groups of the distinguished ideal and quotient. We then apply our results to a class of…

We establish an equivariant quantum Giambelli formula for partial flag varieties. The answer is given in terms of a specialization of universal double Schubert polynomials. Along the way, we give new proofs of the presentation of the…

The classical number system encodes magnitude using a single scalar value whose sign positive or negative has remained conceptually unchanged for centuries. This work introduces Multisign Algebra, a mathematical generalization of the sign…

The problem of representing a given positive integer as a sum of four squares of integers has been widely concerned for a long time, and for a given positive odd $n$ one can find a representation by doing arithmetic in a maximal order of…

The Fibonacci polynomials are defined recursively as $f_{n}(x)=xf_{n-1}(x)+f_{n-2}(x)$, where $f_0(x) = 0$ and $f_1(x)= 1$. We generalize these polynomials to an arbitrary number of variables with the $r$-Fibonacci polynomial. We extend…

In this extended abstract, we present a simple approach to convergence on term graphs that allows us to unify term graph rewriting and infinitary term rewriting. This approach is based on a partial order and a metric on term graphs. These…

Following Bhargava and Hanke's celebrated 290-theorem, we prove a universality theorem for all positive-definite integer-valued quadratic forms that represent all positive integers coprime to $3$. In particular, if a positive-definite…