Related papers: Trace representation and linear complexity of bina…
In this paper, we introduce a notion of ladder representations for split odd special orthogonal groups and symplectic groups over a non-archimedean local field of characteristic zero. This is a natural class in the admissible dual which…
Codes which have a finite field $\mathbb{F}_{q^m}$ as their alphabet but which are only linear over a subfield $\mathbb{F}_q$ are a topic of much recent interest due to their utility in constructing quantum error correcting codes. In this…
In this paper, we construct two generalized cyclotomic binary sequences of period $2p^{m}$ based on the generalized cyclotomy and compute their linear complexity, showing that they are of high linear complexity when $m\geq 2$.
Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…
In this work we show how to decompose a linear code relatively to any given poset metric. We prove that the complexity of syndrome decoding is determined by a maximal (primary) such decomposition and then show that a refinement of a partial…
We take the trace of Von-Neumann's ergodic theorem and get a trace formula of a unitary matrix family. It is an extension of Poisson summation formula in higher dimension. We also construct a family of crystalline measure with complex…
Sequences with {\em perfect linear complexity profile} were defined more than thirty years ago in the study of measures of randomness for binary sequences. More recently {\em apwenian sequences}, first with values $\pm 1$, then with values…
It is shown that, under some mild technical conditions, representations of prime numbers by binary quadratic forms can be computed in polynomial complexity by exploiting Schoof's algorithm, which counts the number of $\mathbb F_q$-points of…
We derive weighted summation identities involving the second order recurrence sequence $\{w_n\} =\{ w_n(a,b; p, q)\}$ defined by $w_0 = a,\,w_1 = b;\,w_n = pw_{n - 1} - qw_{n - 2}\, (n \ge 2)$, where $a$, $b$, $p$ and $q$ are arbitrary…
The linear complexity of a sequence $s$ is one of the measures of its predictability. It represents the smallest degree of a linear recursion which the sequence satisfies. There are several algorithms to find the linear complexity of a…
We study representations of the double affine Lie algebra associated to a simple Lie algebra. We construct a family of indecomposable integrable representations and identify their irreducible quotients. We also give a condition for the…
Given any elliptic system with $t$-independent coefficients in the upper-half space, we obtain representation and trace for the conormal gradient of solutions in the natural classes for the boundary value problems of Dirichlet and Neumann…
We define the notions of trace, determinant and, more generally, Berezinian of matrices over a (Z_2)^n graded commutative associative algebra. The applications include a new approach to the classical theory of matrices with coefficients in…
Series-parallel (SP) graphs are binary edge-labeled graphs with a designated source and target vertex, built using serial and parallel composition. A set of graphs is recognizable if membership depends only on its image under a homomorphism…
We present a method for obtaining congruences modulo powers of a prime number~$p$ for combinatorial sequences whose generating function satisfies an algebraic differential equation. This method generalises the one by Kauers and the authors…
In this paper, for an odd prime $p$, several classes of two-weight linear codes over the finite field $\mathbb{F}_p$ are constructed from the defining sets, and then their complete weight distributions are determined by employing character…
Recently, linear codes constructed from defining sets have been studied extensively. They may have nice parameters if the defining set is chosen properly. Let $ m >2$ be a positive integer. For an odd prime $ p $, let $ r=p^m $ and…
Associated to quantum affine general linear Lie superalgebras are two families of short exact sequences of representations whose first and third terms are irreducible: the Baxter TQ relations involving infinite-dimensional representations;…
Can we do arithmetic in a completely different way, with a radically different data structure? Could this approach provide practical benefits, like operations on giant numbers while having an average performance similar to traditional…
For the trace of Besov spaces $B^s_{p,q}$ onto a hyperplane, the borderline case with $s=\frac{n}{p}-(n-1)$ and $0<p<1$ is analysed and a new dependence on the sum-exponent $q$ is found. Through examples the restriction operator defined for…