Results 141 to 150 of about 98,739 (338)

Permutations, hyperplanes and polynomials over finite fields

Finite Fields and Their Applications, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
András Gács, Tamás Héger, Zoltán Lóránt Nagy, Dömötör Pálvölgyi   +3 more
openaire   +4 more sources

Permutation Polynomials Over Finite Fields: A Geometric Approach [PDF]

, 2015
The purpose of this paper is to utilize algebraic-geometric ideas in the study of polynomials for which the associated polynomial functions are permuta- tions of a given finite field. Polynomials of this type are called permutation polynomials.
Martha Martinez
core  

Fundamental Challenges, Physical Implementations, and Integration Strategies for Ising Machines in Large‐Scale Optimization Tasks

Advanced Electronic Materials, EarlyView.
Ising machines are emerging as specialized hardware solvers for computationally hard optimization problems. This review examines five major platforms—digital CMOS, analog CMOS, emerging devices, coherent optics, and quantum systems—highlighting physics‐rooted advantages and shared bottlenecks in scalability and connectivity.
Hyunjun Lee, Joon Pyo Kim, Sanghyeon Kim
wiley   +1 more source

Permutation polynomials of degree 6 or 7 over finite fields of characteristic 2 [PDF]

, 2010
In Dickson (1896–1897) [2], the author listed all permutation polynomials up to degree 5 over an arbitrary finite field, and all permutation polynomials of degree 6 over finite fields of odd characteristic.
Li, Jiyou, Xiang, Qing, Chandler, David B., Jiyou Li, David B. Chandler, Qing Xiang   +5 more
core   +1 more source

Smart Exploration of Perovskite Photovoltaics: From AI Driven Discovery to Autonomous Laboratories

Advanced Energy Materials, EarlyView.
In this review, we summarize the fundamentals of AI in automated materials science, and review AI applications in perovskite solar cells. Then, we sum up recent progress in AI‐guided manufacturing optimization, and highlight AI‐driven high‐throughput and autonomous laboratories.
Wenning Chen, Zheyu Zhang, Kelvian T. Mularso, Bonghyun Jo, Hyun Suk Jung   +4 more
wiley   +1 more source

Machine Learning Interatomic Potentials for Energy Materials: Architectures, Training Strategies, and Applications

Advanced Energy Materials, EarlyView.
Machine learning interatomic potentials bridge quantum accuracy and computational efficiency for materials discovery. Architectures from Gaussian process regression to equivariant graph neural networks, training strategies including active learning and foundation models, and applications in solid‐state electrolytes, batteries, electrocatalysts ...
In Kee Park, Saeed Pourasad, Jinhong Mun, Arunkumar Chitteth Rajan, Tae Hyeon Park, Anand Rohit, Mohammad Zafari, Tan‐Lien Pham, Eunjae Jung, Bonseung Koo, Miran Ha, Gi Beom Sim, Hyun Gyu Park, Won Woong Choi, Kwanghyeon Jo, Soohaeng Yoo Willow, David ChangMo Yang, Chang Woo Myung, Geunsik Lee, Kwang S. Kim   +19 more
wiley   +1 more source

Factorization of polynomials over finite fields [PDF]

, 2016
The fundamental theorem of algebra states that every non-constant polynomial with complex coefficients can be factorized on linear factors with coefficients from the same field.
Papič, Magda
core  

Farmers' Preferences for Gene Editing Crops and Influencing Factors

Applied Economic Perspectives and Policy, EarlyView.
ABSTRACT Gene editing (GE) is gaining momentum worldwide, but limited data on UK farmers' preferences hinders our understanding of its potential impact amid deregulation debates. Based on a survey of 200 English arable farmers, we employ a Latent Class Analysis and Multinomial Logit regressions to investigate current preferences for GE crops.
Bertolozzi‐Caredio Daniele, Vigani Mauro   +1 more
wiley   +1 more source

Polynomial bound for the partition rank vs the analytic rank of tensors

Discrete Analysis, 2020
Polynomial bound for the partition rank vs the analytic rank of tensors, Discrete Analysis 2020:7, 18 pp. There are a number of proofs in additive combinatorics that involve bilinear forms on $\mathbb F_p^n$ that split into a high-rank case and a low ...
Oliver Janzer
doaj   +1 more source

Factoring Polynomials over Special Finite Fields

Finite Fields and Their Applications, 2001
The main result of this paper is a theoretical algorithm to factorize polynomials over large finite fields (Theorem~1 below). Let \(\Phi_k\) be the \(k\)th cyclotomic polynomial. Then the authors prove the following results. Theorem 1. There is a deterministic algorithm such that, for some constant \(c>0\) -- given a prime \(p\), positive integers \(n\)
Lenstra, H.W., Bach, E., Gathen, J. von zur   +2 more
openaire   +3 more sources