Related papers: Turyn-type sequences: Classification, Enumeration …

Inversion sequences of length $n$ are integer sequences $e_1,\ldots ,e_n$ with $0\le e_i<i$ for all $i$, which are in bijection with the permutations of length $n$. In this paper, we classify all Wilf equivalence classes of pattern-avoiding…

Let $n \in \mathbb{Z}_{>0}$. We prove that there exist a finite set $V$ and finitely many algebraic curves $T_1, \ldots, T_k$ with the following property: if $(x_1, \ldots, x_n, y)$ is an $(n+1)$-tuple of pairwise distinct singular moduli…

Let (k(n)) n=1,2,... be a strictly increasing sequence of positive integers . We consider a specific sequence of differential operators Tk(n),{\lambda} , n=1,2,... on the space of entire functions , that depend on the sequence (k(n))…

Let $R$ be a local principal ideal ring of length two, for example, the ring $R=\Z/p^2\Z$ with $p$ prime. In this paper we develop a theory of normal forms for similarity classes in the matrix rings $M_n(R)$ by interpreting them in terms of…

The Thue--Morse sequence $\{t(n)\}_{n\geqslant 1}$ is the indicator function of the parity of the number of ones in the binary expansion of positive integers $n$, where $t(n)=1$ (resp. $=0$) if the binary expansion of $n$ has an odd (resp.…

Recently, a relation between Schreier-type sets and Tur\'{a}n graphs was discovered. In this note, we give a combinatorial proof and obtain a generalization of the relation. Specifically, for $p, q\ge 1$, let $$\mathcal{A}_q :=…

A Skolem sequence of order n is a sequence S_n=(s_{1},s_{2},...,s_{2n}) of 2n integers containing each of the integers 1,2,...,n exactly twice, such that two occurrences of the integer j in {1,2,...,n} are separated by exactly j-1 integers.…

A set A is a Sidon set in an additive group G if every element of G can be written at most one way as sum of two elements of A. A particular case of two-dimensional Sidon sets are the sonar sequences, which are two-dimensional…

This paper presents a class of random orthogonal sequences associated with the number theoretic Hilbert transform. We present a constructive procedure for finding the random sequences for different modulus values. These random sequences…

We update the list of odd integers n<10000 for which an Hadamard matrix of order 4n is known to exist. We also exhibit the first example of base sequences BS(40,39). Consequently, there exist T-sequences TS(n) of length n=79. The first…

Stanley sequences starting from the set $\{0, n\}$ where $n$ is a positive integer have long been conjectured to be divided into two types: the "regular" type where the growth rate is $\Theta(n^{\log_2(3)})$, and the "irregular" type where…

We prove an asymptotic for the number of additive triples of bijections $\{1,\dots,n\}\to\mathbb{Z}/n\mathbb{Z}$, that is, the number of pairs of bijections $\pi_1,\pi_2\colon \{1,\dots,n\}\to\mathbb{Z}/n\mathbb{Z}$ such that the pointwise…

Inversion sequences are finite sequences of non-negative integers, where the value of each entry is bounded from above by its position. Patterns in inversion sequences have been studied by Corteel-Martinez-Savage-Weselcouch and…

A nut graph is a simple graph whose adjacency matrix is singular with $1$-dimensional kernel such that the corresponding eigenvector has no zero entries. In 2020, Fowler et al. characterised for each $d \in \{3,4,\ldots,11\}$ all values $n$…

The Thue--Morse sequence is a prototypical automatic sequence found in diverse areas of mathematics, and in computer science. We study occurrences of factors $w$ within this sequence, more precisely, the sequence of gaps between consecutive…

Let s,t,m,n be positive integers such that sm=tn. Let M(m,s;n,t) be the number of m x n matrices over {0,1,2,...} with each row summing to s and each column summing to t. Equivalently, M(m,s;n,t) counts 2-way contingency tables of order m x…

A sequence $\Big(u_n\Big)_{n=0}^{\infty}$ is said to be convex if it satisfies the following inequality $$ 2u_n\leq u_{n-1}+u_{n+1}\qquad \mbox{for all}\qquad n\in\mathbb{N}. $$ We present several characterizations of convex sequences and…

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…

Let $\mathbf u=(u_n)_{n\in\mathbb N}$ be a sequence in $\mathbb N_+$ with $u_0=1$ and $u_n\mid u_{n+1}$ for every $n\in\mathbb N$, and let $b_n:=u_{n+1}/u_n$ for every $n\in\mathbb N_+$. For every $r\in [0,1)$, there exists a unique…

For a set of positive integers $D$, a $k$-term $D$-diffsequence is a sequence of positive integers $a_1<a_2<\cdots<a_k$ such that $a_i-a_{i-1}\in D$ for $i=2,3,\cdots,k$. For $k\in\mathbb{Z}^+$ and $D\subset \mathbb{Z}^+$, we define…