English
Related papers

Related papers: Barker sequences of odd length

200 papers

In this article, we study the palindromic length sequences of the ruler sequence and of the period-doubling sequence. We give a precise formula of the palindromic length sequence of the first one and find a lower bound of the limit superior…

Combinatorics · Mathematics 2020-07-17 Shuo Li

Binary $m$-sequences are ones with the largest period $n=2^m-1$ among the binary sequences produced by linear shift registers with length $m$. They have a wide range of applications in communication since they have several desirable…

Information Theory · Computer Science 2022-12-01 Xiaoyan Jing , Aixian Zhang , Keqin Feng

In 1930s Paul Erdos conjectured that for any positive integer C in any infinite +1 -1 sequence (x_n) there exists a subsequence x_d, x_{2d}, ... , x_{kd} for some positive integers k and d, such that |x_d + x_{2d} + ... + x_{kd}|> C. The…

Discrete Mathematics · Computer Science 2014-02-18 Boris Konev , Alexei Lisitsa

Negative orientable sequences, i.e. periodic sequences with elements from a finite alphabet of size at least three in which an n-tuple or the negative of its reverse appears at most once in a period of the sequence, were introduced by…

Combinatorics · Mathematics 2026-02-09 Chris J Mitchell , Peter R Wild

Let $L_n$ be the length of the longest common subsequence of two independent i.i.d. sequences of Bernoulli variables of length $n$. We prove that the order of the standard deviation of $L_n$ is $\sqrt{n}$, provided the parameter of the…

Probability · Mathematics 2009-07-30 Jüri Lember , Heinrich Matzinger

A collection of complex sequences of length v is complementary if the sum of their periodic autocorrelation function values at all non-zero shifts is constant. For a complex sequence A=[a_0,a_1,...,a_{v-1}] of length v=dm we define the…

Combinatorics · Mathematics 2015-08-05 Dragomir Z. Djokovic , Ilias S. Kotsireas

Although 10^230 terms of Recaman's sequence have been computed, it remains a mystery. Here three distant cousins of that sequence are described, one of which is also mysterious. (i) {A(n), n >= 3} is defined as follows. Start with n, and…

We introduce the notions of $\tau$-exceptional and signed $\tau$-exceptional sequences for any finite dimensional algebra. We prove that for a fixed algebra of rank $n$, and for any positive integer $t \leq n$, there is a bijection between…

Representation Theory · Mathematics 2021-06-04 Aslak Bakke Buan , Bethany Marsh

Given a set of $t$ words of length $n$ over a $k$-letter alphabet, it is proved that there exists a common subsequence among two of them of length at least $\frac{n}{k}+cn^{1-1/(t-k-2)}$, for some $c>0$ depending on $k$ and $t$. This is…

Combinatorics · Mathematics 2014-10-23 Boris Bukh , Jie Ma

A $d$-subsequence of a sequence $\varphi = x_1\dots x_n$ is a subsequence $x_i x_{i+d} x_{i+2d} \dots$, for any positive integer $d$ and any $i$, $1 \le i \le n$. A \textit{$k$-Thue sequence} is a sequence in which every $d$-subsequence,…

Combinatorics · Mathematics 2020-05-15 Borut Lužar , Martina Mockovčiaková , Pascal Ochem , Alexandre Pinlou , Roman Soták

A de Bruijn covering code is a q-ary string S so that every q-ary string is at most R symbol changes from some n-word appearing consecutively in S. We introduce these codes and prove that they can have length close to the smallest possible…

Combinatorics · Mathematics 2007-07-16 Fan Chung , Joshua N. Cooper

The ``comma sequence'' starts with 1 and is defined by the property that if k and k' are consecutive terms, the two-digit number formed from the last digit of k and the first digit of k' is equal to the difference k'-k. If there is more…

Number Theory · Mathematics 2024-05-28 Eric Angelini , Michael S. Branicky , Giovanni Resta , N. J. A. Sloane , David W. Wilson

Exceptional sequences are certain ordered sequences of quiver representations. We introduce a class of objects called strand diagrams and use this model to classify exceptional sequences of representations of a quiver whose underlying graph…

Representation Theory · Mathematics 2016-11-15 Alexander Garver , Kiyoshi Igusa , Jacob P. Matherne , Jonah Ostroff

This paper is part of the ongoing effort to study high-dimensional permutations. We prove the analogue to the Erd\H{o}s-Szekeres theorem: For every $k\ge1$, every order-$n$ $k$-dimensional permutation contains a monotone subsequence of…

Combinatorics · Mathematics 2017-10-24 Nathan Linial , Michael Simkin

Let $n$ be a positive integer and let $S$ be a sequence of $n$ integers in the interval $[0,n-1]$. If there is an $r$ such that any nonempty subsequence with sum $\equiv 0$ $\pmod n$ has length $=r,$ then $S$ has at most two distinct…

Number Theory · Mathematics 2009-03-02 Weidong Gao , Y. O. Hamidoune , Guoqing Wang

It is well known that the length of a beta-reduction sequence of a simply typed lambda-term of order k can be huge; it is as large as k-fold exponential in the size of the lambda-term in the worst case. We consider the following relevant…

Logic in Computer Science · Computer Science 2023-06-22 Kazuyuki Asada , Naoki Kobayashi , Ryoma Sin'ya , Takeshi Tsukada

This study continues three recent papers in which barypolygonal sequences have been defined and their properties of convergence demonstrated. Any barypolygonal sequence $\mathcal{B}$ of a finite set $\mathcal{A}$ comprising $p\ge 2$ points…

Algebraic Geometry · Mathematics 2021-04-01 David Pouvreau , Vincent Bouis

The Pursley-Sarwate criterion of a pair of finite complex-valued sequences measures the collective smallness of the aperiodic autocorrelations and the aperiodic crosscorrelations of the two sequences. It is known that this quantity is…

Information Theory · Computer Science 2019-05-30 Christian Günther , Kai-Uwe Schmidt

Let s_k/t_k, k>= 0, be the convergents of the continued fraction expansion of a real number x. We investigate the sequence of Jacobi symbols (s_k/t_k), k>= 0. We show that this sequence is purely periodic with shortest possible period…

Number Theory · Mathematics 2013-03-13 Kurt Girstmair

All codes with minimum distance 8 and codimension up to 14 and all codes with minimum distance 10 and codimension up to 18 are classified. Nonexistence of codes with parameters [33,18,8] and [33,14,10] is proved. This leads to 8 new exact…

Information Theory · Computer Science 2016-11-18 Iliya Bouyukliev , Erik Jakobsson