English
Related papers

Related papers: Linear complexity of quaternary sequences over Z4 …

200 papers

We define two new families of polynomials that generalize permanents and prove upper and lower bounds on their determinantal complexities comparable to the known bounds for permanents. One of these families is obtained by replacing…

Combinatorics · Mathematics 2022-03-01 Tristram Bogart , Juan Andrés Valero

Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…

Data Structures and Algorithms · Computer Science 2012-04-13 Vinícius G. P. de Sá , Guilherme D. da Fonseca , Raphael Machado , Celina M. H. de Figueiredo

We consider the class of algebras of rank 4 equipped with a standard involution over an arbitrary base ring. In particular, we characterize quaternion rings, those algebras defined by the construction of the even Clifford algebra.

Number Theory · Mathematics 2011-04-21 John Voight

We investigate the arithmetic nature of P-recursive sequences through the lens of their D-finite generating functions. Building on classical tools from differential algebra, we revisit the integrality criterion for Motzkin-type sequences…

Number Theory · Mathematics 2025-11-05 Anastasia Matveeva

We compute the degree complexity of a family of birational mappings of the plane with high order singularities.

Dynamical Systems · Mathematics 2009-11-13 Eric Bedford , Kyounghee Kim , Truong Trung Tuyen , Nina Abarenkova , Jean-Marie Maillard

We construct two families of orthogonal polynomials associated with the universal central extensions of the superelliptic Lie algebras. These polynomials satisfy certain fourth order linear differential equations, and one of the families is…

Representation Theory · Mathematics 2025-07-23 Felipe Albino dos Santos , Mikhail Neklyudov , Vyacheslav Futorny

It has recently been shown that the problem of testing global convexity of polynomials of degree four is {strongly} NP-hard, answering an open question of N.Z. Shor. This result is minimal in the degree of the polynomial when global…

Optimization and Control · Mathematics 2019-03-14 Amir Ali Ahmadi , Georgina Hall

The autocorrelation values of two classes of binary sequences are shown to be good in [6]. We study the 2-adic complexity of these sequences. Our results show that the 2-adic complexity of such sequences is large enough to resist the attack…

Information Theory · Computer Science 2020-11-25 Shiyuan Qiang , Xiaoyan Jing , Minghui Yang

This paper is a synthesis and extension of three earlier papers on $PD_4$-complexes $X$ with fundamental group $\pi$ such that $c.d.\pi=2$ and $\pi$ has one end. Our goal is to show that the homotopy types of such complexes are determined…

Geometric Topology · Mathematics 2026-05-14 Jonathan A. Hillman

{\small In this paper, we find a class of division quaternion algebras over the field }$\mathbb{Q}\left( i\right) ${\small \ and a class of division symbol algebras over a cyclotomic field.}

Number Theory · Mathematics 2014-11-11 Diana Savin

We provide several new $q$-congruences for truncated basic hypergeometric series, mostly of arbitrary order. Our results include congruences modulo the square or the cube of a cyclotomic polynomial, and in some instances, parametric…

Number Theory · Mathematics 2019-02-25 Victor J. W. Guo , Michael J. Schlosser

We build a new theory for analyzing the coefficients of any cyclotomic polynomial by considering it as a gcd of simpler polynomials. Using this theory, we generalize a result known as periodicity and provide two new families of flat…

Number Theory · Mathematics 2012-07-26 Sam Elder

Sequences with low auto-correlation property have been applied in code-division multiple access communication systems, radar and cryptography. Using the inverse Gray mapping, a quaternary sequence of even length $N$ can be obtained from two…

Information Theory · Computer Science 2017-05-17 W Su , Y Yang , Z Zhou , X Tang

We prove a complexity dichotomy theorem for the six-vertex model. For every setting of the parameters of the model, we prove that computing the partition function is either solvable in polynomial time or #P-hard. The dichotomy criterion is…

Computational Complexity · Computer Science 2017-03-31 Jin-Yi Cai , Zhiguo Fu , Mingji Xia

In this paper, cyclic codes are established over some finite quaternion integer rings with respect to the quaternion Mannheim distance, and de- coding algorithm for these codes is given.

Information Theory · Computer Science 2010-03-24 Murat Guzeltepe , Mehmet Ozen

Somos 4 sequences are a family of sequences defined by a fourth-order quadratic recurrence relation with constant coefficients. For particular choices of the coefficients and the four initial data, such recurrences can yield sequences of…

Number Theory · Mathematics 2025-09-25 Christine Swart , Andrew Hone

We derive a parameterization of simple modules for the cyclotomic Hecke algebras of type $G(r,p,n)$ over field of any (coprime to $p$) characteristic. We give explicit formulas for the number of simple modules over these cyclotomic Hecke…

Representation Theory · Mathematics 2007-11-19 Jun Hu

The families of quasi-simple or Cayley--Klein algebras associated to antihermitian matrices over R, C and H are described in a unified framework. These three families include simple and non-simple real Lie algebras which can be obtained by…

Mathematical Physics · Physics 2007-05-23 Francisco J. Herranz , Mariano Santander

In this work, we study a class of skew cyclic codes over the ring $R:=\mathbb{Z}_4+v\mathbb{Z}_4,$ where $v^2=v,$ with an automorphism $\theta$ and a derivation $\Delta_\theta,$ namely codes as modules over a skew polynomial ring…

Information Theory · Computer Science 2024-01-25 Djoko Suprijanto , Hopein Christofen Tang

We consider the homotopy types of $PD_4$-complexes $X$ with fundamental group $\pi$ such that $c.d.\pi=2$ and $\pi$ has one end. Let $\beta=\beta_2(\pi;F_2)$ and $w=w_1(X)$. Our main result is that (modulo two technical conditions on…

Geometric Topology · Mathematics 2011-10-20 Jonathan A. Hillman
‹ Prev 1 8 9 10 Next ›