Related papers: Trace representation and linear complexity of bina…
We introduce a new class of evaluation linear codes by evaluating polynomials at the roots of a suitable trace function. We give conditions for self-orthogonality of these codes and their subfield-subcodes with respect to the Hermitian…
In the representation theory of real reductive Lie groups, many objects have finiteness properties. For example, the lengths of Verma modules and principal series representations are finite, and more precisely, they are bounded. In this…
For integral representations of associated Legendre functions in terms of modified Bessel functions, we establish justification for differentiation under the integral sign with respect to parameters. With this justification, derivatives for…
In 2000, Darmon introduced the notion of Frey representations within the framework of the modular method for studying the generalized Fermat equation. A central step in this program is the computation of their conductors, with the case at…
An integer sequence that is defined by initial values and a linear recurrence with constant integer coefficients, can be represented by the difference of two arithmetic terms containing exponentiation. All constants occuring in the term are…
We propose a pattern recognition method that identifies the common tangent lines of a set of ellipses. The detection of the tangent lines is attained by applying the Legendre transform on a given set of ellipses. As context, we consider a…
We consider translates of functions in $L^2(\RRd)$ along an irregular set of points. Introducing a notion of pseudo-Gramian function for the irregular case, we obtain conditions for a family of irregular translates to be a Bessel sequence…
A method for encoding and decoding spectrum shaped binary run-length constrained sequences is described. The binary sequences with predefined range of exponential sums are introduced. On the base of Cover's enumerative scheme, recurrence…
Motivated by the constructions of binary sequences by utilizing the cyclic elliptic function fields over the finite field $\mathbb{F}_{2^{n}}$ by Jin \textit{et al.} in [IEEE Trans. Inf. Theory 71(8), 2025], we extend the construction to…
We briefly discuss linear algebraic, combinatorial, and applied aspects of an exact model representation of binary arrays. As an illustration, we present two linear algebraic portraits of a string of characters.
A representation of solutions of the one-dimensional Dirac equation is obtained. The solutions are represented as Neumann series of Bessel functions. The representations are shown to be uniformly convergent with respect to the spectral…
Recently, $p$-presentation distances for $p\in [1,\infty]$ were introduced for merge trees and multiparameter persistence modules as more sensitive variations of the respective interleaving distances ($p=\infty)$. It is well-known that…
Traces and their extension called combined traces (comtraces) are two formal models used in the analysis and verification of concurrent systems. Both models are based on concepts originating in the theory of formal languages, and they are…
The primary objective of this section is to demonstrate that the actual pseudorandom measures of our construction are significantly smaller than the theoretical upper bounds derived from the Weil theorem. Regarding the family of sequences,…
We investigate induced modules of doublet algebra in (1,p) logarithmic models. We give fermionic formulas for the characters of induced modules and coinvariants with respect to different subalgebras calculated in the irreducible modules.…
Let $K$ denote a field, and let $V$ denote a vector space over $K$ with finite positive dimension. We consider a pair of linear transformations $A:V \to V$ and $A^*:V \to V$ that satisfy (i), (ii) below: (i) There exists a basis for $V$…
For a given prime $p$, a new construction of families of the complex valued sequences of period $p$ with efficient implementation is given by applying both multiplicative characters and additive characters of finite field $\mathbb{F}_p$.…
We consider a family of integer sequences generated by nonlinear recurrences of the second order, which have the curious property that the terms of the sequence, and integer multiples of the ratios of successive terms (which are also…
In this paper, we define the linear complexity for multidimensional sequences over finite fields, generalizing the one-dimensional case. We give some lower and upper bounds, valid with large probability, for the linear complexity and…
We give a simple matrix-based proof of congruence equations modulo a prime $p$ involving sums of binomial coefficients appearing in Pascal's triangle. These equations can be used to construct some groups of exponent $p^n$. These groups, as…