English
Related papers

Related papers: On linear ternary Intersection sequences and their…

200 papers

Each acyclic graph, and more generally, each acyclic orientation of the graph associated to a Cartan matrix, allows to define a so-called frise; this is a collection of sequences over the positive natural numbers, one for each vertex of the…

Rings and Algebras · Mathematics 2009-06-12 Ibrahim Assem , Christophe Reutenauer , David Smith

Turyn-type sequences, TT(n), are quadruples of {+,-1}-sequences (A;B;C;D), with lengths n,n,n,n-1 respectively, where the sum of the nonperiodic autocorrelation functions of A,B and twice that of C,D is a delta-function (i.e., vanishes…

Combinatorics · Mathematics 2013-01-22 D. Best , D. Z. Djokovic , H. Kharaghani , H. Ramp

An abelian square is the concatenation of two words that are anagrams of one another. A word of length $n$ can contain $\Theta(n^2)$ distinct factors that are abelian squares. We study infinite words such that the number of abelian square…

Discrete Mathematics · Computer Science 2015-06-12 Gabriele Fici , Filippo Mignosi

Let $E$ be an elliptic curve over $\mathbb{Q}$ described by $y^2= x^3+ Kx+ L$ where $K, L \in \mathbb{Q}$. A set of rational points $(x_i,y_i) \in E(\mathbb{Q})$ for $i=1, 2, \cdots, k$, is said to be a sequence of consecutive cubes on $E$…

Number Theory · Mathematics 2018-06-05 Gamze Savaş Çelik , Gökhan Soydan

Fraenkel and Simpson showed that the number of distinct squares in a word of length n is bounded from above by 2n, since at most two distinct squares have their rightmost, or last, occurrence begin at each position. Improvements by Ilie to…

Formal Languages and Automata Theory · Computer Science 2017-08-23 F. Blanchet-Sadri , S. Osborne

Sequences with high linear complexity have wide applications in cryptography. In this paper, a new class of quaternary sequences over $\mathbb{F}_4$ with period $2p^mq^n$ is constructed using generalized cyclotomic classes. Results show…

Information Theory · Computer Science 2020-01-30 Qiuyan Wang , Chenhuang Wu , Minghui Yang , Yang Yan

The Tribonacci sequence $\mathbb{T}$ is the fixed point of the substitution $\sigma(a,b,c)=(ab,ac,a)$. The main result is twofold: (1) we give the explicit expressions of the numbers of distinct squares and cubes in $\mathbb{T}[1,n]$ (the…

Dynamical Systems · Mathematics 2016-06-08 Huang Yuke , Wen Zhiying

We first review some topics in the classical computational geometry of lines, in particular the O(n^{3+\epsilon}) bounds for the combinatorial complexity of the set of lines in R^3 interacting with $n$ objects of fixed description…

Metric Geometry · Mathematics 2007-05-23 Frank Sottile , Thorsten Theobald

We describe various properties of continued fraction expansions of complex numbers in terms of Gaussian integers. Numerous distinct such expansions are possible for a complex number. They can be arrived at through various algorithms, as…

Number Theory · Mathematics 2011-02-21 S. G. Dani , Arnaldo Nogueira

We propose a new approach to extending the notion of commutator and Lie algebra to algebras with ternary multiplication laws. Our approach is based on ternary associativity of the first and second kind. We propose a ternary commutator,…

Rings and Algebras · Mathematics 2024-09-05 Viktor Abramov

Let $V$ denote a vector space over C with finite positive dimension. By a {\em Leonard triple} on $V$ we mean an ordered triple of linear operators on $V$ such that for each of these operators there exists a basis of $V$ with respect to…

Combinatorics · Mathematics 2008-04-10 Stefko Miklavic

We shall characterize the structure of invertible substitutions on three-letter alphabet. We show that any invertible substitution, after some cyclic operation, can be written as a finite product of permutations and Fibonacci's…

Group Theory · Mathematics 2007-05-23 B. Tan , Z. -X. Wen , Y. -P. Zhang

Sturmian words form a family of one-sided infinite words over a binary alphabet that are obtained as a discretization of a line with an irrational slope starting from the origin. A finite version of this class of words called Christoffel…

Formal Languages and Automata Theory · Computer Science 2025-07-22 Abhishek Krishnamoorthy , Robinson Thamburaj , Durairaj Gnanaraj Thomas

We propose the ternary generalization of the classical anti-commutativity and study the algebras whose generators are ternary anti-commutative. The integral over an algebra with an arbitrary number of generators N is defined and the formula…

High Energy Physics - Theory · Physics 2007-05-23 Viktor Abramov

We classify closed curves on a once-punctured torus with a single self-intersection from a combinatorial perspective. We determine the number of closed curves with given word-length and with zero, one, and arbitrary self-intersections.

Geometric Topology · Mathematics 2025-11-11 David Fisac , Mingkun Liu

To construct ternary "quaternions" following Hamilton we must introduce two "imaginary "units, $q_1$ and $q_2$ with propeties $q_1^n=1$ and $q_2^m=1$. The general is enough difficult, and we consider the $m=n=3$. This case gives us the…

Mathematical Physics · Physics 2010-06-30 Gennady Volkov

A supercharacter theory for a finite group $G$ is a set of superclasses each of which is a union of conjugacy classes together with a set of sums of irreducible characters called supercharacters that together satisfy certain compatibility…

Group Theory · Mathematics 2016-05-31 Ali Reza Ashrafi , Fatemeh Koorepazan-Moftakhar

The Stern diatomic sequence is closely linked to continued fractions via the Gauss map on the unit interval, which in turn can be understood via systematic subdivisions of the unit interval. Higher dimensional analogues of continued…

The focus of this work is the study of Parikh matrices with emphasis on two concrete problems. In the first part of our presentation we show that a conjecture by Dick at al. in 2021 only stands in the case of ternary alphabets, while…

Combinatorics · Mathematics 2024-10-22 Robert Mercaş , Wen Chean Teh

We introduce hypergeometric-type sequences. They are linear combinations of interlaced hypergeometric sequences (of arbitrary interlacements). We prove that they form a subring of the ring of holonomic sequences. An interesting family of…

Symbolic Computation · Computer Science 2024-04-22 Bertrand Teguia Tabuguia
‹ Prev 1 8 9 10 Next ›