Related papers: Three-phase Golay sequence and array triads
On the set of positive integers, we consider the iterative process that maps $n$ to either $\frac{3n+1}{2}$ or $\frac{n}{2}$ depending on the parity of $n$. The Collatz conjecture states that all such sequences eventually enter the trivial…
In this paper, we first give new generalizations for third-order Horadam $\{H_{n}^{(3)}\}_{n\in \mathbb{N}}$ and generalized Tribonacci $\{h_{n}^{(3)}\}_{n\in \mathbb{N}}$ sequences for classic Horadam and generalized Fibonacci numbers.…
We study the complexity of S-adic sequences corresponding to a family of 216 multi-dimensional continued fractions maps, called Triangle Partition maps (TRIP maps), with an emphasis on those with low upper bounds on complexity. Our main…
We use groups with triality to construct a series of nonassociative Moufang loops. Certain members of this series contain an abelian normal subloop with the corresponding quotient being a cyclic group. In particular, we give a new series of…
We explore a general framework how to treat coupled-channel systems in the presence of overlapping left and right-hand cuts as well as anomalous thresholds. Such systems are studied in terms of a generalized potential, where we exploit the…
The evolutionary trajectory of a protein through sequence space is constrained by function and three-dimensional (3D) structure. Residues in spatial proximity tend to co-evolve, yet attempts to invert the evolutionary record to identify…
Generating complete 3D objects under partial occlusions (i.e., amodal scenarios) is a practically important yet challenging problem, as large portions of object geometry are unobserved in real-world scenarios. Existing approaches either…
The conclusion that the length of an arithmetic progression of the form ${3^x+2^y}$ is at most six is proved.
We give a stopping criterion for the enumeration of all conjugacy classes in cocompact triangle groups up to any geometric length. The enumeration is based on an encoding given by P. Dehornoy and T. Pinsky.
We prove a conjectured graph theoretic characterization of a geometric property of 3 dimensional linkages posed 15 years ago by Sitharam and Gao, motivated by their equivalent characterization for $d\le 2$ that does not generalize to $d\ge…
Considered is the distribution of the crosscorrelation between $m$-sequences of length $2^m-1$, where $m=2k$, and $m$-sequences of shorter length $2^k-1$. New pairs of $m$-sequences with three-valued crosscorrelation are found and the…
Orbits in the principal planes of triaxial potentials are known to be prone to unstable motion normal to those planes, so that three dimensional investigations of those orbits are needed even though they are two dimensional. We present here…
Delayed interactions are a common property of coupled natural systems and therefore arise in a variety of different applications. For instance, signals in neural or laser networks propagate at finite speed giving rise to delayed…
The phase diagram, ($T,\rho$), of a finite, constrained, and classical system is built from the analysis of cluster distributions in phase and configurational space. The obtained phase diagram can be split in three regions. One, low density…
In this paper, we report the identification of global and partial phase synchronizations in linear arrays of unidirectionally coupled piecewise linear time-delay systems with two different coupling configurations. In particular, in a linear…
We present a method for obtaining congruences modulo powers of 3 for sequences given by recurrences of finite depth with polynomial coefficients. We apply this method to Catalan numbers, Motzkin numbers, Riordan numbers, Schr\"oder numbers,…
Triangles are abundant in real-world networks but rare in standard null models for sparse graphs. Existing explanations typically rely on explicit triadic closure mechanisms or geometry-based connection rules. We propose an alternative…
In this article, we give combinatorial formulas for the regularity and the projective dimension of $3$-path ideals of chordal graphs, extending the well-known formulas for the edge ideals of chordal graphs given in terms of the induced…
Boolean networks are a general model of interacting entities, with applications to biological phenomena such as gene regulation. Attractors play a central role, and the schedule of entities update is a priori unknown. This article presents…
The first linear code supporting a $4$-design was the $[11, 6, 5]$ ternary Golay code discovered in 1949 by Golay. In the past 71 years, sporadic linear codes holding $4$-designs or $5$-designs were discovered and many infinite families of…