Results 91 to 100 of about 98,739 (338)

Switchable Magnonic Crystals Based on Spin Crossover/CrSBr Heterostructures

open access: yesAdvanced Materials, EarlyView.
Multiscale modeling is employed to investigate the functionality of a light‐controlled, tunable magnonic crystal based on spin‐crossover Fe‐pz molecules integrated with a monolayer of CrSBr. Ab initio simulations confirm that the molecules remain functional on the CrSBr surface, while a semiclassical elastic model demonstrates that light‐induced ...
Andrei Shumilin   +4 more
wiley   +1 more source

Unimodular polynomial matrices over finite fields [PDF]

open access: yesJournal of Algebraic Combinatorics, 2020
14 ...
Akansha Arora   +2 more
openaire   +2 more sources

On the Dispersions of the Polynomial Maps over Finite Fields [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2008
We investigate the distributions of the different possible values of polynomial maps ${\Bbb F}_q^n\longrightarrow{\Bbb F}_q$, $x\longmapsto P(x)$. In particular, we are interested in the distribution of their zeros, which are somehow dispersed over the whole domain ${\Bbb F}_q^n$.
openaire   +3 more sources

Space‐Time Coding Conformal Metasurfaces for Multifrequency Beam Steering and Shaping

open access: yesAdvanced Materials, EarlyView.
Space‐time coding conformal metasurfaces enable dynamic wave control on curved surfaces by combining programmable spatial patterns with temporal modulation. This study shows that a single conformal aperture can independently manipulate multiple frequency components, achieving multifunctional beam shaping and steering, with implications for ...
Filippo Pepe   +8 more
wiley   +1 more source

Further study on permutation polynomials over finite fields

open access: yes四川大学学报. 自然科学版, 2019
Permutation polynomials over finite fields becomes an interesting subject. To constructing new classes permutation polynomials is an open problem raised by Lidl and Mullen in 1988.
QIN Xiao-Er, YAN Li
doaj  

Evaluation of Some Sums of Polynomials in Fq[t]

open access: yesJournal of Applied Mathematics, 2019
We prove the polynomial analogues of some Liouville identities from elementary number theory. Consequently several sums defined over the finite fields Fq[t] are evaluated by combining the results obtained and some of the results from sums of reciprocals ...
Adama Diene
doaj   +1 more source

On flux integrals for generalized Melvin solution related to simple finite-dimensional Lie algebra

open access: yesEuropean Physical Journal C: Particles and Fields, 2017
A generalized Melvin solution for an arbitrary simple finite-dimensional Lie algebra $$\mathcal G$$ G is considered. The solution contains a metric, n Abelian 2-forms and n scalar fields, where n is the rank of $$\mathcal G$$ G .
V. D. Ivashchuk
doaj   +1 more source

Subquadratic-time factoring of polynomials over finite fields

open access: yesSymposium on the Theory of Computing, 1995
New probabilistic algorithms are presented for factoring univariate polynomials over finite fields. The algorithms factor a polynomial of degree n over a finite field of constant cardinality in time O(n 1.815 ).
E. Kaltofen, V. Shoup
semanticscholar   +1 more source

Functional graphs of polynomials over finite fields

open access: yesJournal of Combinatorial Theory, Series B, 2016
Given a function $f$ in a finite field ${\mathbb F}_q$ of $q$ elements, we define the functional graph of $f$ as a directed graph on $q$ nodes labelled by the elements of ${\mathbb F}_q$ where there is an edge from $u$ to $v$ if and only if $f(u) = v$.
Sergei V. Konyagin   +5 more
openaire   +3 more sources

Factorization of Polynomials over Finite Fields and Characteristic Sequences [PDF]

open access: yes, 1993
A new factorization algorithm for polynomials over finite fields was recently developed by the first author. For finite fields of characteristic 2, it is known from previous work that this algorithm has several advantages over the classical Berlekamp ...
Niederreiter, Harald, Göttfert, Rainer
core   +1 more source

Home - About - Disclaimer - Privacy