Results 11 to 20 of about 581 (30)

Associative nil-algebras over finite fields [PDF]

, 2013
The nilpotency degree of a relatively free finitely generated associative algebra with the identity $x^n=0$ is studied over finite fields.Comment: 12 ...
Artem A. Lopatin, Ivan, P. Shestakov
core   +1 more source

Eisenstein Polynomials over Function Fields

, 2015
In this paper we compute the density of monic and non-monic Eisenstein polynomials of fixed degree having entries in an integrally closed subring of a function field over a finite ...
Dotti, Edoardo, Micheli, Giacomo
core   +1 more source

On the Arithmetic Exceptionality of Polynomial Mappings

, 2017
In this note we prove that certain polynomial mappings $P_\mathfrak{g}^k(\mathbf{x}) \in \mathbf{Z}[\mathbf{x}]$ in $n$-variables obtained from simple complex Lie algebras $\mathfrak{g}$ of arbitrary rank $n \ge 1$, are exceptional.Comment: 5 ...
Küçüksakallı, Ömer
core   +1 more source

No bursts detected from FRB121102 in two 5-hour observing campaigns with the Robert C. Byrd Green Bank Telescope [PDF]

, 2018
Here, we report non-detection of radio bursts from Fast Radio Burst FRB 121102 during two 5-hour observation sessions on the Robert C. Byrd 100-m Green Bank Telescope in West Virginia, USA, on December 11, 2017, and January 12, 2018.
Croft, Steve, DeBoer, David, Gajjar, Vishal, Hallinan, Gregg, Hellbourg, Greg, Isaacson, Howard, Lebofsky, Matt, Lee, Kejia, Liu, Zhiyong, Lynch, Ryan, MacMahon, David H. E., Men, Yunpeng, Price, Danny C., Rosenthal, Lee, Siemion, Andrew, Xu, Yonghua   +15 more
core   +1 more source

Root multiplicities and number of nonzero coefficients of a polynomial

, 2005
It is known that the weight (that is, the number of nonzero coefficients) of a univariate polynomial over a field of characteristic zero is larger than the multiplicity of any of its nonzero roots.
Brindza B., Mattarei S., SANDRO MATTAREI
core   +3 more sources

Relative rank and regularization

Forum of Mathematics, Sigma
We introduce a new concept of rank – relative rank associated to a filtered collection of polynomials. When the filtration is trivial, our relative rank coincides with Schmidt rank (also called strength).
Amichai Lampert, Tamar Ziegler
doaj   +1 more source

On sets of irreducible polynomials closed by composition

, 2016
Let $\mathcal S$ be a set of monic degree $2$ polynomials over a finite field and let $C$ be the compositional semigroup generated by $\mathcal S$. In this paper we establish a necessary and sufficient condition for $C$ to be consisting entirely of ...
A Batra, A Batra, A Ostafe, D Gomez, GL Mullen, J ZurGathen von, O Ahmadi, R Barbulescu, R Jones, R Jones, R Lidl, S Gao, S Gao, V Shoup   +13 more
core   +1 more source

Counting irreducible binomials over finite fields

, 2015
We consider various counting questions for irreducible binomials over finite fields.
Heyman, Randell, Shparlinski, Igor E.
core   +1 more source

Security analysis of ZKPoK based on MQ problem in the multi-instance setting

Journal of Mathematical Cryptology
Bidoux and Gaborit introduced a new general technique to improve zero-knowledge (ZK) proof-of-knowledge (PoK) schemes for a large set of well-known post-quantum hard computational problems such as the syndrome decoding, the permuted kernel, the rank ...
Kahrobaei Delaram, Perret Ludovic, Vigorito Martina   +2 more
doaj   +1 more source

Squares and difference sets in finite fields [PDF]

, 2013
For infinitely many primes p = 4k+1 we give a slightly improved upper bound for the maximal cardinality of a set B ⊂ Z p such that the difference set B−B contains only quadratic residues. Namely, instead of the ”trivial” bound |B| ≤ √p we prove |B √p
Bachoc, C., Matolcsi, Máté, Ruzsa, Z. Imre   +2 more
core