中文
相关论文

相关论文: Non-standard binary representations and the Stern …

200 篇论文

In a recent preprint on ArXiv, Bacher introduced a twisted version of the Stern sequence. His paper contains in particular three conjectures relating the generating series for the Stern sequence and for the twisted Stern sequence. Soon…

数论 · 数学 2013-05-09 Jean-Paul Allouche

It is shown that metric representation of DNA sequences is one-to-one. By using the metric representation method, suppression of nucleotide strings in the DNA sequences is determined. For a DNA sequence, an optimal string length to display…

生物物理 · 物理学 2007-05-23 Zuo-Bing Wu

Here, we give upper and lower bounds on the count of positive integers $n\le x$ dividing the $n$th term of a nondegenerate linearly recurrent sequence with simple roots.

We classify all binary error correcting completely regular codes of length $n$ with minimum distance $\delta>n/2$.

组合数学 · 数学 2014-04-08 Neil I. Gillespie

We introduce the sequence $(i_n)_{n \geq 0}$ defined by $i_n = (-1)^{inv_2(n)}$, where $inv_2(n)$ denotes the number of inversions (i.e., occurrences of 10 as a scattered subsequence) in the binary representation of n. We show that this…

组合数学 · 数学 2014-08-13 Philip Lafrance , Narad Rampersad , Randy Yee

Many problems in Computer Science can be abstracted to the following question: given a set of objects and rules respectively, which new objects can be produced? In the paper, we consider a succinct version of the question: given a set of…

数据结构与算法 · 计算机科学 2012-01-04 Tian-Ming Bu , Chen Yuan , Peng Zhang

We introduce a full binary directed tree structure to represent the set of natural numbers, further categorizing them into three distinct subsets: pure odd numbers, pure even numbers, and mixed numbers. We adopt a binary string…

综合数学 · 数学 2024-06-12 Jishe Feng

In a recent paper, Roland Bacher conjectured three identities concerning Stern's sequence and its twist. In this paper we prove Bacher's conjectures. Possibly of independent interest, we also give a way to compute the Stern value (or…

数论 · 数学 2010-10-19 Michael Coons

An identity for binomial symbols modulo an odd positive integer $n$ relating to the least prime factor of $n$ is proved. The identity is discussed within the context of Pell conics.

数论 · 数学 2011-07-29 Samuel A. Hambleton

We prove a relationship between certain integer expressions involving operators similar to the binary exclusive or. This gives a proof and generalization of a result conjectured about sequence A178729 in Sloane's Online Encyclopedia of…

数论 · 数学 2025-06-12 H A Verrill

We discuss an equivalence relation on the set of square binary matrices with the same number of 1's in each row and each column. Each binary matrix is represented using ordered n-tuples of natural numbers. We give a few starting values of…

组合数学 · 数学 2014-02-18 Krasimir Yordzhev

In this paper we consider the following problems: how many different subsets of Sigma^n can occur as set of all length-n factors of a finite word? If a subset is representable, how long a word do we need to represent it? How many such…

形式语言与自动机理论 · 计算机科学 2013-04-15 Shuo Tan , Jeffrey Shallit

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…

组合数学 · 数学 2013-04-23 Nathaniel Johnston

We will consider the indefinite truncated multidimensional moment problem. Necessary and sufficient conditions for a given truncated multisequence to have a signed representing measure $\mu$ with ${\rm card}\,{\rm supp}\, \mu$ as small as…

泛函分析 · 数学 2020-06-17 David P. Kimsey

Let $\mathcal{A}$ be a finite subset of $\mathbb{N}$ including $0$ and $f_\mathcal{A}(n)$ be the number of ways to write $n=\sum_{i=0}^{\infty}\epsilon_i2^i$, where $\epsilon_i\in\mathcal{A}$. We consider asymptotics of the summatory…

数论 · 数学 2015-09-07 Katie Anders

In this paper we examine a number of term rewriting system for integer number representations, building further upon the datatype defining systems described in [2]. In particular, we look at automated methods for proving confluence and…

计算机科学中的逻辑 · 计算机科学 2016-07-18 Boas Kluiving , Wijnand van Woerkom

In this paper, the construction of finite-length binary sequences whose nonlinear complexity is not less than half of the length is investigated. By characterizing the structure of the sequences, an algorithm is proposed to generate all…

信息论 · 计算机科学 2023-12-27 Sicheng Liang , Xiangyong Zeng , Zibi Xiao , Zhimin Sun

Morphic sequences form a natural class of infinite sequences, typically defined as the coding of a fixed point of a morphism. Different morphisms and codings may yield the same morphic sequence. This paper investigates how to prove that two…

符号计算 · 计算机科学 2024-07-29 Hans Zantema

We show that there is a bijection between real-linear automorphisms of the multicomplex numbers of order $n$ and signed permutations of length $2^{n-1}$. This allows us to deduce a number of results on the multicomplex numbers, including a…

环与代数 · 数学 2022-11-28 Nicolas Doyon , Pierre-Olivier Parisé , William Verreault

Let $f_4(n)$ be the number of hyperquaternary representations of $n$ and $b_4(n)$ be the number of balanced quaternary representations of $n$. We show that there is no integer $k$ such that $f_4(n+k)=b_4(n)$ for all $n\ge -k$, in contrast…