Related papers: Cyclic relative difference sets and circulant weig…

We consider the periods of the linear congruential and the power generators modulo $n$ and, for fixed choices of initial parameters, give lower bounds that hold for ``most'' $n$ when $n$ ranges over three different sets: the set of primes,…

We review some recent results on recursion relations which help evaluating arbitrary non-diagonal, radial hydrogenic matrix elements of $r^\lambda$ and of $\beta r^\lambda$ ($\beta$ a Dirac matrix) derived in the context of Dirac…

Cyclic metric Lie groups are Lie groups equipped with a left-invariant metric which is in some way far from being biinvariant, in a sense made explicit in terms of Tricerri and Vanhecke's homogeneous structures. The semisimple and solvable…

Classical Bianchi-Lie, Backlund and Darboux transformations are considered. Their generalizations for the dynamical systems are discussed. For the transformation being the generalization of the normal shift the special class of dynamical…

This study investigates a powerful model, targeted to subjective assessments, based on pairwise comparisons. It provides a proof that a distance-based inconsistency reduction transforms an inconsistent pairwise comparisons (PC) matrix into…

The dynamics of the second order rational difference equation $\displaystyle{z_{n+1}=\frac{\alpha + z_{n-1}}{\beta z_n + z_{n-1}}}$ with the real parameter $\alpha$, $\beta$ and arbitrary non-negative real initial conditions is investigated…

Lattices with a circulant generator matrix represent a subclass of cyclic lattices. This subclass can be described by a basis containing a vector and its circular shifts. In this paper, we present certain conditions under which the norm…

A higher order difference equation may be generally defined in an arbitrary nonempty set S as: \[ f_{n}(x_{n},x_{n-1},...,x_{n-k})=g_{n}(x_{n},x_{n-1},...,x_{n-k}) \] where $f_{n},g_{n} :S^{k+1}\rightarrow S$ are given functions for…

Cyclic codes are an interesting subclass of linear codes and have been used in consumer electronics, data transmission technologies, broadcast systems, and computer applications due to their efficient encoding and decoding algorithms. In…

The notion of lambda-symmetries, originally introduced by C. Muriel and J.L. Romero, is extended to the case of systems of first-order ODE's (and of dynamical systems in particular). It is shown that the existence of a symmetry of this type…

We give a cyclic sieving phenomenon for symplectic $\lambda$-tableaux $SP(\lambda,2m)$, where $\lambda$ is a partition of an odd integer $n$ and $gcd(m,p)=1$ for any odd prime $p\leq n$. We use the crystal structure on Kashiwara-Nakashima…

We consider cyclic codes $\mathcal{C}_\mathcal{L}$ associated to quadratic trace forms in $m$ variables $Q_R(x) = \operatorname{Tr}_{q^m/q}(xR(x))$ determined by a family $\mathcal{L}$ of $q$-linearized polynomials $R$ over…

Let $2<n<m\leq \omega$. Let $\CA_n$ denote the class of cylindric algebras of dimension $n$ and $\RCA_n$ denote the class of representable $\CA_n$s. We say that $\A\in \RCA_n$ is representable up to $m$ if $\Cm\At\A$ has an $m$-square…

In order to deal with imprecision, ambiguity, and uncertainty in data analysis, Pawlak introduced rough set theory in 1982. This paper aims to expand the scope of basic set theory developed by presenting the notions of…

We consider the alternating sign matrices of the odd order that have some kind of central symmetry. Namely, we deal with matrices invariant under the half-turn, quarter-turn and flips in both diagonals. In all these cases, there are two…

This paper presents a selected tour through the theory and applications of lifts of convex sets. A lift of a convex set is a higher-dimensional convex set that projects onto the original set. Many convex sets have lifts that are…

We classify rotary (orientably-regular) maps whose underlying graphs are multicycles. For the multicycle $\mathrm{C}_n^{(\lambda)}$ of length $n$ and edge-multiplicity $\lambda$, we determine all rotary embeddings for $n\geqslant 3$ and…

Based on an axiomatic approach we propose two related novel one-parameter families of indicators of change which put in a relation classical indicators of change such as absolute change, relative change and the log-ratio.

A now-classical cyclic extension of the descent set of a permutation has been introduced by Klyachko and Cellini. Following a recent axiomatic approach to this notion, it is natural to ask which sets of permutations admit such an extension.…

For a positive integer $n$, a collection $S$ of subsets of $[n]=\{1,\ldots,n\}$ is called symmetric if $X\in S$ implies $X^\ast\in S$, where $X^\ast:=\{i\in [n]\colon n-i+1\notin X\}$ (the involution $\ast$ was introduced by Karpman).…