Results 71 to 80 of about 1,007,951 (256)

A proof that the maximal rank for plane quartics is seven

Le Matematiche, 2015
At the time of writing, the general problem of finding the maximal Waring rank for homogeneous polynomials of fixed degree and number of variables (or, equivalently, the maximal symmetric rank for symmetric tensors of fixed order and in fixed dimension ...
Alessandro De Paris
doaj  

Partially-Symmetric Macdonald Polynomials

, 2022
Nonsymmetric Macdonald polynomials can be symmetrized in all their variables to obtain the (symmetric) Macdonald polynomials. We generalize this process, symmetrizing the nonsymmetric Macdonald polynomials in only the first k out of n variables.
Goodberry, Benjamin Nathaniel
core  

The Relationship Between Semiclassical Laguerre Polynomials and the Fourth Painlevé Equation [PDF]

, 2013
We discuss the relationship between the recurrence coefficients of orthogonal polynomials with respect to a semiclassical Laguerre weight and classical solutions of the fourth Painlevé equation. We show that the coefficients in these recurrence relations
Clarkson, Peter, Jordaan, Kerstin, Clarkson, P.A., Jordaan, Kerstin Heidrun   +3 more
core   +1 more source

High‐Throughput Screening for Accelerated Oxide Glass Discovery

Advanced Science, EarlyView.
A high‐throughput screening platform is presented that allows for accelerating laboratory glass synthesis by a factor of 102, using multicomponent stereolithographic printing. Automatic sample evaluation is achieved via Raman spectroscopy and similarity analysis without any sample preparation.
Igor Seibel‐Geraschenko, Josef Slowik, Franziska Scheffler, Alexis Duval, N. M. Anoop Krishnan, Lothar Wondraczek   +5 more
wiley   +1 more source

Statistics of Quantum Numbers for Non-Equivalent Fermions in Single-j Shells

Atoms
This work addresses closed-form expressions for the distributions P(M) of the magnetic quantum numbers M and Q(J) of total angular momentum J for non-equivalent fermions in single-j orbits.
Jean-Christophe Pain
doaj   +1 more source

Recurrences in Terms of Special Polynomials for Exponential Sums of Elementary Symmetric Polynomials over Finite Fields

, 2023
It is known that exponential sums of symmetric Boolean functions are linear recurrent. The characteristic polynomial of the homogeneous linear recurrence that they satisfy can be expressed in terms of cyclotomic polynomials. In this work, we study the general recurrence for $q$-ary functions and, in the case of 3-ary functions, we express the ...
Gómez-Flores, Axel O., Medina, Luis A., Pomales, Luisiany, Santiago-Calderón, Carlos F.   +3 more
openaire   +3 more sources

Symplectic duality of Symmetric Spaces [PDF]

, 2008
We show that between symmetric spaces of different types there exists a bi-symplectic map.
Loi, Andrea, Di Scala, Antonio Jose', ANDREA LOI, DI SCALA A. J., Di Scala, Antonio J.   +4 more
core   +1 more source

Exceptional Antimodes in Multi‐Drive Cavity Magnonics

Advanced Electronic Materials, EarlyView.
Driven‐dissipative cavity‐magnonics provides a flexible platform for engineering non‐Hermitian physics such as exceptional points. Here, using a four‐port, three‐mode system with controllable microwave interference, antimodes and coherent perfect extinction (CPE) are realized, enabling active tuning to antimode exceptional points.
Mawgan A. Smith, Ryan D. McKenzie, Alban Joseph, Robert L. Stamps, Rair Macêdo   +4 more
wiley   +1 more source

Highly‐Uniform Passive Crossbar Arrays of Resistive Switching Random Access Memory (RRAM) for In‐Memory Computing Applications

Advanced Electronic Materials, EarlyView.
Passive resistive memory arrays promise efficient in‐memory computing but suffer from sneak paths and programming variability. Here, highly uniform 32 × 32 passive RRAM crossbars are programmed with multilevel precision below 3% error and 99.5% yield.
S. Ricci, P. Mannocci, M. Porzani, D. Bridarolli, F. Carletti, M. Farronato, D. Ielmini   +6 more
wiley   +1 more source

Computing the Elementary Symmetric Polynomials in Positive Characteristics

Electron. Colloquium Comput. Complex.
We first extend the results of Chatterjee,Kumar,Shi,Volk(Computational Complexity 2022) by showing that the degree $d$ elementary symmetric polynomials in $n$ variables have formula lower bounds of $Ω(d(n-d))$ over fields of positive characteristic.
openaire   +4 more sources