English
Related papers

Related papers: Constructing Picard curves with complex multiplica…

200 papers

The problem of robustly reconstructing an integer vector from its erroneous remainders appears in many applications in the field of multidimensional (MD) signal processing. To address this problem, a robust MD Chinese remainder theorem…

Signal Processing · Electrical Eng. & Systems 2023-11-21 Li Xiao , Haiye Huo , Xiang-Gen Xia

Permutation polynomials over finite fields play important roles in finite fields theory. They also have wide applications in many areas of science and engineering such as coding theory, cryptography, combinatorial design, communication…

Information Theory · Computer Science 2015-09-01 Kangquan Li , Longjiang Qu , Xi Chen

Polynomial multiplication is a fundamental problem in symbolic computation. There are efficient methods for the multiplication of two univariate polynomials. However, there is rarely efficiently nontrivial method for the multiplication of…

Computational Complexity · Computer Science 2024-03-20 Cancan Wang , Ming Su , Gang Wang , Qingpo Zhang

We consider a Chinese remainder theorem for (labeled) graphs. For $X$ a GKM $T$-variety and $Y$ an invariant subvariety, we use this to give a condition for surjectivity of the restriction map $H^*(X) \to H^*(Y)$. In particular, this…

Algebraic Geometry · Mathematics 2020-04-09 James B. Carrell , Kiumars Kaveh

Recently Takens' Reconstruction Theorem was studied in the complex analytic setting by Forn{\ae}ss and Peters \cite{FP}. They studied the real orbits of complex polynomials, and proved that for non-exceptional polynomials ergodic properties…

Dynamical Systems · Mathematics 2021-09-06 Luka Boc Thaler

Counterparts of several classical results of number theory are proven for the ring of polynomials with coefficients in a number field. A theorem of Milnor that determines the Witt ring of a function field is applied to prove an analogue of…

Number Theory · Mathematics 2024-07-09 William Duke

We provide two families of algorithms to compute characteristic polynomials of endomorphisms and norms of isogenies of Drinfeld modules. Our algorithms work for Drinfeld modules of any rank, defined over any base curve. When the base curve…

Symbolic Computation · Computer Science 2024-11-19 Xavier Caruso , Antoine Leudière

In this paper, new context of Chinese Remainder Theorem (CRT) based analysis of combinatorial sequence generators has been presented. CRT is exploited to establish fixed patterns in LFSR sequences and underlying cyclic structures of finite…

Cryptography and Security · Computer Science 2015-04-07 Muhammad Asad Khan , Amir Ali Khan , Fauzan Mirza

We prove a higher dimensional generalization of Gross and Zagier's theorem on the factorization of differences of singular moduli. Their result is proved by giving a counting formula for the number of isomorphisms between elliptic curves…

Number Theory · Mathematics 2011-12-12 Eyal Z. Goren , Kristin E. Lauter

We provide an algorithm for computing the Euler characteristic of the curves $S_p$ in the space of cubic polynomials, consisting of all polynomials with a periodic critical point of period $p$. The curves were introduced in [Milnor,…

Dynamical Systems · Mathematics 2012-01-10 Laura DeMarco , Aaron Schiff

We can associate with any irreducible curve singularity (ics) a numerical semigroup. Two ics are said to be equisingular if they have the same semigroup. Two equisingular ics have the same Milnor number. Conversely, The set of ics with a…

Algebraic Geometry · Mathematics 2007-05-23 Abdallah Assi , Margherita Barile

In this paper, we consider a question of sum-keeping about a multiplicative subsemigroup and its generator subsets in a semiring, and develop some elementary (collapse) process of the sum-keeping retraction through subsets until one minimal…

Number Theory · Mathematics 2025-04-04 Derong Qiu

We construct cryptographic trilinear maps that involve simple, non-ordinary abelian varieties over finite fields. In addition to the discrete logarithm problems on the abelian varieties, the cryptographic strength of the trilinear maps is…

Cryptography and Security · Computer Science 2018-05-09 Ming-Deh A. Huang

For a finite field of odd number of elements we construct families of permutation binomials and permutation trinomials with one fixed-point (namely zero) and remaining elements being permuted as disjoint cycles of same length. Binomials and…

Combinatorics · Mathematics 2023-06-28 Anitha G , P Vanchinathan

We show the existence of and explicitly construct generic polynomials for various groups, over fields of positive characteristic. The methods we develop apply to a broad class of connected linear algebraic groups defined over finite fields…

Number Theory · Mathematics 2016-01-19 Eric Y. Chen , J. T. Ferrara , Liam Mazurowski

Let $C$ be a smooth projective curve over the field of complex numbers $\mathbb{C}$ of genus $g(C)>0$. Let $E$ be a locally free sheaf on $C$ of rank $r$ and degree $e$. Let $\mathcal{Q}:={\rm Quot}_{C/\mathbb{C}}(E,k,d)$ denote the Quot…

Algebraic Geometry · Mathematics 2024-02-28 Chandranandan Gangopadhyay , Ronnie Sebastian

Quantum deformations of sets of points of the real and the complexified projective line are constructed. These deformations depend on the deformation parameter q and certain further parameters \lambda_{ij}. The deformations for which the…

Quantum Algebra · Mathematics 2009-11-11 Frank Leitenberger

We compute the K-theory of ring C*-algebras for polynomial rings over finite fields. The key ingredient is a duality theorem which we had obtained in a previous paper. It allows us to show that the K-theory of these algebras has a ring…

Operator Algebras · Mathematics 2009-11-30 Joachim Cuntz , Xin Li

We present a specialized point-counting algorithm for a class of elliptic curves over F\_{p^2} that includes reductions of quadratic Q-curves modulo inert primes and, more generally, any elliptic curve over F\_{p^2} with a low-degree…

Number Theory · Mathematics 2019-02-20 François Morain , Charlotte Scribot , Benjamin Smith

We consider a subclass of tilings, the tilings obtained by cut and projection. Under somewhat standard assumptions, we show that the natural complexity function has polynomial growth. We compute its exponent \alpha in terms of the ranks of…

Dynamical Systems · Mathematics 2008-12-18 Antoine Julien