Related papers: A Construction for Perfect Periodic Autocorrelatio…
We investigate $p$-adic automorphic forms on unitary groups through the geometry of infinite-level unitary Shimura varieties and the Hodge-Tate period map. We first develop a perfectoid construction of overconvergent automorphic forms.…
In this work, we study a continued fractions theory for the topological completion of the field of Puiseux series. As usual, we prove that any element in the completion can be developed as a unique continued fractions, whose coefficients…
We show how the bialgebra cohomologies of two Hopf algebras involved in an exact sequence are related, when the third factor is finite-dimensional cosemisimple. As an application, we provide a short proof of the computation of the bialgebra…
We study the factor complexity and closure properties of automatic sequences based on Parry or Bertrand numeration systems. These automatic sequences can be viewed as generalizations of the more typical $k$-automatic sequences and…
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…
We prove the conjecture of Grosse-Kunstleve et al. that coordination sequences of periodic structures in n-dimensional Euclidean space are rational. This has been recently proven by Nakamura et al.; however, our proof is a straightforward…
Using the analytical expressions for the genuine eigenfunctions $\varphi_{\mu\nu}(z)$ and eigenvalues $E_{\mu,\nu}$, of open, bounded and quasi-bounded finite periodic systems, we derive the eigenfunctions space-inversion symmetry…
On an infinite, radial metric tree graph we consider the corresponding Laplacian equipped with self-adjoint vertex conditions from a large class including $\delta$- and weighted $\delta'$-couplings. Assuming the numbers of different edge…
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…
Recent work of Garvan, Sellers, Smoot, and others has made connections between infinite families of congruences for various partition functions. Here, we apply this approach to families of congruences for PED and POD partitions and find…
In this paper we study almost $p$-ary sequences and their autocorrelation coefficients. We first study the number $\ell$ of distinct out-of-phase autocorrelation coefficients for an almost $p$-ary sequence of period $n+s$ with $s$…
In this work we extend our study on a link between automaticity and certain algebraic power series over finite fields. Our starting point is a family of sequences in a finite field of characteristic $2$, recently introduced by the first…
Binary sequences with good autocorrelation properties and large linear complexity are useful in stream cipher cryptography. The Sidelnikov-Lempel-Cohn-Eastman (SLCE) sequences have nearly optimal autocorrelation. However, the problem of…
Let PCS_p^N denote a set of p binary sequences of length N such that the sum of their periodic auto-correlation functions is a delta-function. In the 1990, Boemer and Antweiler addressed the problem of constructing such sequences. They…
Golomb and Welch conjectured in 1970 that there only exist perfect Lee codes for radius $t=1$ or dimension $n=1, 2$. It is admitted that the existence and the construction of quasi-perfect Lee codes have to be studied since they are the…
Eick & Leedham-Green sketched a construction for infinite sequences of finite $p$-groups with fixed coclass. These infinite sequences have turned out to be very useful in the theory of finite $p$-groups. We exhibit a detailed description…
This article present a new, direct and simple formula for constructing Mignotte sequences.
We give exact formulas for the transmission (i.e. the sum of all distances between vertices) of perfect trees and rooted powers of (connected finite) graphs.
This paper describes new, simple, recursive methods of construction for orientable sequences, i.e. periodic binary sequences in which any n-tuple occurs at most once in a period in either direction. As has been previously described, such…
Nested graphs have been used in different applications, for example to represent knowledge in semantic networks. On the other hand, graphs with cycles are really important in surface reconstruction, periodic schedule and network analysis.…