Related papers: The Proof of Lin's Conjecture via the Decimation-H…

We prove the existence of a ternary sequence of factor complexity $2n+1$ for any given vector of rationally independent letter frequencies. Such sequences are constructed from an infinite product of two substitutions according to a…

This short note introduces a geometric representation for binary (or ternary) sequences. The proposed representation is linked to multivariate data plotting according to the radar chart. As an illustrative example, the binary Hamming…

This paper proposes a totally constructive approach for the proof of Hilbert's theorem on ternary quartic forms. The main contribution is the ladder technique, with which the Hilbert's theorem is proved vividly.

In this paper we introduce the notion of linear computability as a method of finding the Waring rank of forms. We use this notion to find infinitely many new examples which satisfy Strassen's Conjecture.

In this paper, first we introduce the notion of an embedding tensor on a 3-Lie algebra, which naturally induces a 3-Leibniz algebra. Using the derived bracket, we construct a Lie 3-algebra, whose Maurer-Cartan elements are embedding…

We study trace codes with defining set $L,$ a subgroup of the multiplicative group of an extension of degree $m$ of the alphabet ring $\mathbb{F}_3+u\mathbb{F}_3+u^{2}\mathbb{F}_{3},$ with $u^{3}=1.$ These codes are abelian, and their…

Let $\mathfrak{g}$ be a finite-dimensional complex Lie algebra and $\textrm{HLie}_{m}(\mathfrak{g})$ be the affine variety of all multiplicative Hom-Lie algebras on $\mathfrak{g}$. We use a method of computational ideal theory to describe…

In this paper we present an effective method for computing certain real coefficients $\lambda_{n}$ which appear in a criterion for the Riemann hypothesis proved by Xian-Jin Li. With the use of this method a sequence of over three-thousand…

The paper deals with the computation of the rank and the identifiability of a specific ternary form. Often, one knows some short Waring decomposition of a given form, and the problem is to determine whether the decomposition is minimal and…

For a compact and convex window, Mecke described a process of tessellations which arise from cell divisions in discrete time. At each time step, one of the existing cells is selected according to an equally-likely law. Independently, a line…

We study codes with parameters of the ternary Hamming $(n=(3^m-1)/2,3^{n-m},3)$ code, i.e., ternary $1$-perfect codes. The rank of the code is defined to be the dimension of its affine span. We characterize ternary $1$-perfect codes of rank…

The tensor train decomposition decomposes a tensor into a "train" of 3-way tensors that are interconnected through the summation of auxiliary indices. The decomposition is stable, has a well-defined notion of rank and enables the user to…

The purpose of this paper is to investigate ternary multiplications constructed from a binary multiplication, linear twisting maps and a trace function. We provide a construction of ternary Hom-Nambu and Hom-Nambu-Lie algebras starting from…

Let $\mathcal H$ be the class of algebras verifying Han's conjecture. In this paper we analyse two types of algebras with the aim of providing an inductive step towards the proof of this conjecture. Firstly we show that if an algebra…

The paper is devoted to modal properties of the ternary strict betweenness relation as used in the development of various systems of geometry. We show that such a relation is non-definable in a basic similarity type with a binary operator…

In this paper, we compute the distribution of the first letter statistic on nine avoidance classes of permutations corresponding to two pairs of patterns of length four. In particular, we show that the distribution is the same for each…

Let $D^+$ be the first octant of the Euclidean space and consider the integral cube grid $G$ in $D^+$. The intersections of each line with $G$ form an infinite sequence of three letters which can be considered as an extension of well-known…

This paper demonstrates that third-order real symmetric tensors cannot be classified up to equivalence by their eigenvalues only, thereby resolving a problem posed by Qi in 2006. By applying Harrison's center theory, we derive equivalence…

It has been observed by Assmus and Key as a result of the complete classification of Hadamard matrices of order 24, that the extremality of the binary code of a Hadamard matrix H of order 24 is equivalent to the extremality of the ternary…

A sequence is a fractal sequence if it contains itself as a proper subsequence. (The self-containment property resembles that of visual fractals) A doubly fractal sequence of integers is defined by operations called upper trimming and lower…