English
Related papers

Related papers: The Binary Enots Wolley Sequence

200 papers

The Chowla conjecture asserts that the values of the Liouville function form a normal sequence of plus and minus ones. Reinterpreted in the language of ergodic theory it asserts that the Liouville function is generic for the Bernoulli…

Number Theory · Mathematics 2017-12-13 Nikos Frantzikinakis

This paper presents a substructural logic of sequents with very restricted exchange and weakening rules. It is sound with respect to sequences of measurements of a quantic system. A sound and complete semantics is provided. The semantic…

Quantum Physics · Physics 2023-07-19 Daniel Lehmann

For any integer s >= 0, we derive a combinatorial interpretation for the family of sequences generated by the recursion (parameterized by s) h_s(n) = h_s(n - s - h_s(n - 1)) + h_s(n - 2 - s - h_s(n - 3)), n > s + 3, with the initial…

Combinatorics · Mathematics 2008-05-29 B. Balamohan , Zhiqiang Li , Stephen Tanny

Based upon properties of ordinal length, we introduce a new class of modules, the binary modules, and study their endomorphism ring. The nilpotent endomorphisms form a two-sided ideal, and after factoring this out, we get a commutative…

Commutative Algebra · Mathematics 2012-12-11 Hans Schoutens

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…

Information Theory · Computer Science 2023-12-27 Sicheng Liang , Xiangyong Zeng , Zibi Xiao , Zhimin Sun

Three classes of binary linear codes with at most four nonzero weights were constructed in this paper, in which two of them are projective three-weight codes. As applications, $s$-sum sets for any odd $ s > 1$ were constructed.

Information Theory · Computer Science 2025-08-26 Tonghui Zhang , Pinhui Ke , Zuling Chang

It is a well-known fact that an exchangeable sequence has empirical distributions that form a reverse-martingale. This paper is devoted to proof of the converse statement. As a byproduct of the proof for the binary case, we introduce and…

Probability · Mathematics 2023-09-26 Martin Bladt , Dimitry Shaiderman

Lothar Collatz had proposed in 1937 a conjecture in number theory called Collatz conjecture. Till today there is no evidence of proving or disproving the conjecture. In this paper, we propose an algorithmic approach for verification of the…

General Mathematics · Mathematics 2019-12-13 Venkatesulu Mandadi , Devi Paramwswari

Two estimates for the inverse binary entropy function are derived using the property of information entropy to estimate combinatorics of sequences as well as related formulas from population genetics for the effective number of alleles. The…

Information Theory · Computer Science 2020-05-27 Reginald D. Smith

We show that each member of a doubly infinite sequence of highly nonlinear expressions of Bernoulli polynomials, which can be seen as linear combinations of certain higher-order convolutions, is a multiple of a specific product of linear…

Number Theory · Mathematics 2019-03-29 Karl Dilcher , Armin Straub , Christophe Vignat

A weight-dependent generalization of the binomial theorem for noncommuting variables is presented. This result extends the well-known binomial theorem for q-commuting variables by a generic weight function depending on two integers. For a…

Quantum Algebra · Mathematics 2012-03-19 Michael J. Schlosser

We study some essential arithmetic properties of a new tree-based number representation, {\em hereditarily binary numbers}, defined by applying recursively run-length encoding of bijective base-2 digits. Our representation expresses giant…

Data Structures and Algorithms · Computer Science 2013-06-06 Paul Tarau

Some techniques for the use of bitwise operations are described in the article. As an example, an open problem of isomorphism-free generations of combinatorial objects is discussed. An equivalence relation on the set of square binary…

Combinatorics · Mathematics 2013-05-30 Krasimir Yordzhev

We consider the complexities of substitutive sequences over a binary alphabet. By studying various types of special words, we show that, knowing some initial values, its complexity can be completely formulated via a recurrence formula…

Combinatorics · Mathematics 2015-07-16 Bo Tan , Zhi-Xiong Wen , Yiping Zhang

A collection of integer sequences is jointly ergodic if for every ergodic measure preserving system the multiple ergodic averages, with iterates given by this collection of sequences, converge in the mean to the product of the integrals. We…

Dynamical Systems · Mathematics 2023-02-06 Nikos Frantzikinakis

A wedge (i.e., a closed nonempty set in the Euclidean space stable under addition and multiplication with non-negative scalars) induces by a standard way a semi-order (a reflexive and transitive binary relation) in the space. The wedges…

Optimization and Control · Mathematics 2012-01-24 A. B. Németh , S. Z. Németh

This paper is the continuation of \cite{htl}, where we deal with Lucas sequences. Here we study integers represented by integer sequences which satisfy binary recursive relations. In case of non-degenerate sequences we give bounds for the…

Number Theory · Mathematics 2024-08-12 L. Hajdu , R. Tijdeman

Compact objects observed in gravitational-wave astronomy so far always come in pairs and never individually. Identifying the two components of a binary system is a delicate operation that is often taken for granted. The labeling procedure…

General Relativity and Quantum Cosmology · Physics 2025-09-16 Davide Gerosa , Viola De Renzis , Federica Tettoni , Matthew Mould , Alberto Vecchio , Costantino Pacilio

The number of tuples with positive integers pairwise relatively prime to each other with product at most $n$ is considered. A generalization of $\mu^{2}$ where $\mu$ is the M\"{o}bius function is used to formulate this divisor sum and…

General Mathematics · Mathematics 2021-08-24 Masum Billal

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.

Number Theory · Mathematics 2011-07-29 Samuel A. Hambleton