English
Related papers

Related papers: On the 2-Adic Complexity of the Ding-Helleseth-Mar…

200 papers

In Nielsen's geometric approach to quantum complexity, the introduction of a suitable geometrical space, based on the Lie group formed by fundamental operators, facilitates the identification of complexity through geodesic distance in the…

Quantum Physics · Physics 2025-04-03 Satyaki Chowdhury , Martin Bojowald , Jakub Mielczarek

We compute symplectic cohomology for Milnor fibres of certain compound Du Val singularities that admit small resolution by using homological mirror symmetry. Our computations suggest a new conjecture that the existence of a small resolution…

Symplectic Geometry · Mathematics 2022-06-09 Jonathan David Evans , Yanki Lekili

We adapt the rectangular splitting technique of Paterson and Stockmeyer to the problem of evaluating terms in holonomic sequences that depend on a parameter. This approach allows computing the $n$-th term in a recurrent sequence of suitable…

Symbolic Computation · Computer Science 2013-10-15 Fredrik Johansson

We develop in this work a numerical method for stochastic differential equations (SDEs) with weak second order accuracy based on Gaussian mixture. Unlike the conventional higher order schemes for SDEs based on It\^o-Taylor expansion and…

Numerical Analysis · Mathematics 2021-08-12 Lei Li , Jianfeng Lu , Jonathan Mattingly , Lihan Wang

The extended N=2 supersymmetric Camasa - Holm equation is presented. It is accomplishe by formulation the supersymmeytric version of the Fuchssteiner method. In this framework we use two supersymmetric recursion operators of the N=2,…

Exactly Solvable and Integrable Systems · Physics 2009-11-11 Ziemowit Popowicz

For relatively prime natural numbers $a$ and $b$, we study the two equations $ax+by = (a-1)(b-1)/2$ and $ax+by+1= (a-1)(b-1)/2$, which arise from the study of cyclotomic polynomials. Previous work showed that exactly one equation has a…

In this paper, we reduce the computational complexities of partial and dual partial cyclotomic FFTs (CFFTs), which are discrete Fourier transforms where spectral and temporal components are constrained, based on their properties as well as…

Information Theory · Computer Science 2009-11-13 Ning Chen , Zhiyuan Yan

This paper presents some basic theorems giving the structure of cyclic codes of length n over the ring of integers modulo p^a and over the p-adic numbers, where p is a prime not dividing n. An especially interesting example is the 2-adic…

Combinatorics · Mathematics 2007-07-16 A. R. Calderbank , N. J. A. Sloane

We analyze the statistical complexity vs. entropy plane-representation of sampled chaotic attractors as a function of the sampling period {\tau}. It is shown that if the Bandt and Pompe procedure is used to assign a probability distribution…

Pseudorandom binary sequences with optimal balance and autocorrelation have many applications in stream cipher, communication, coding theory, etc. It is known that binary sequences with three-level autocorrelation should have an almost…

Cryptography and Security · Computer Science 2016-02-22 Minglong Qi , Shengwu Xiong , Jingling Yuan , Wenbi Rao , Luo Zhong

In this paper, we provide a family of generalized discrete $q$-Hermite II polynomials denoted by $\tilde{h}_{n,\alpha}(x,y|q)$. An explicit relations connecting them with the $q$-Laguerre and Stieltjes-Wigert polynomials are obtained.…

Mathematical Physics · Physics 2019-05-14 Sama Arjika

In this paper we study some sophisticated supercongruences involving dual sequences. For $n=0,1,2,\ldots$ define $$d_n(x)=\sum_{k=0}^n\binom nk\binom xk2^k$$ and $$s_n(x)=\sum_{k=0}^n\binom nk\binom xk\binom{x+k}k=\sum_{k=0}^n\binom…

Number Theory · Mathematics 2017-04-21 Zhi-Wei Sun

In this paper, we study the abelian complexity $\rho_n^{ab}(\mathbf{t}^{(k)})$ of generalized Thue-Morse sequences $\mathbf{t}^{(k)}$. We obtain the exact value of $\rho_n^{ab}(\mathbf{t}^{(k)})$ for every integer $n\geq k$. Consequently,…

Combinatorics · Mathematics 2019-04-11 Jin Chen , Zhi-Xiong Wen

This paper presents the concept of digit polynomials, which leads to a deterministic and unconditional integer factorization algorithm with the runtime complexity $\mathcal{O}(N^{1/4+\epsilon})$. Strassen's well known factoring approach is…

Number Theory · Mathematics 2015-12-22 Markus Hittmeir

We study the non-minimal composite Higgs model with global symmetry $\text{SO}(7)$ broken to $\text{SO}(5)\times \text{SO}(2)$. The model results in a composite Two-Higgs doublet model (2HDM) equipped with two extra singlets, the lightest…

High Energy Physics - Phenomenology · Physics 2019-11-20 Alessandro Davoli , Andrea De Simone , David Marzocca , Alessandro Morandini

We present novel algorithms to factor polynomials over a finite field $\F_q$ of odd characteristic using rank $2$ Drinfeld modules with complex multiplication. The main idea is to compute a lift of the Hasse invariant (modulo the polynomial…

Number Theory · Mathematics 2016-06-06 Anand Kumar Narayanan

V.I. Arnold has recently defined the complexity of a sequence of $n$ zeros and ones with the help of the operator of finite differences. In this paper we describe the results obtained for almost most complicated sequences of elements of a…

Number Theory · Mathematics 2012-07-10 E. Yu Lerner

We show that su(2) rational and trigonometric Gaudin models, or in other words, generalised coupled angular momenta systems, have singularities that undergo Hamiltonian Hopf bifurcations. In particular, we find a normal form for the…

Dynamical Systems · Mathematics 2024-10-10 Tobias Våge Henriksen

In this work we will analyse the complexity factor, proposed by L. Herrera, for spherically symmetric static matter distributions satisfying a polytropic equation through the gravitational decoupling method. Specifically, we will use the…

General Relativity and Quantum Cosmology · Physics 2022-11-04 C. Las Heras , P. Leon

Suppose $4|n$, $n\geq 8$, $F=F_n=\mathbb{Q}(\zeta_n+\bar{\zeta}_n)$, and there is one prime $\mathfrak{p}=\mathfrak{p}_n$ above $2$ in $F_n$. We study amalgam presentations for $\operatorname{PU_{2}}(\mathbb{Z}[\zeta_n, 1/2])$ and…

Number Theory · Mathematics 2020-01-09 Colin Ingalls , Bruce W. Jordan , Allan Keeton , Adam Logan , Yevgeny Zaytman