Results 41 to 50 of about 972,893 (286)

A New Approach to Determine the Minimal Polynomials of Binary Modified de Bruijn Sequences

open access: yesMathematics, 2022
A binary modified de Bruijn sequence is an infinite and periodic binary sequence derived by removing a zero from the longest run of zeros in a binary de Bruijn sequence.
Musthofa   +3 more
doaj   +1 more source

Singular polynomials from orbit spaces [PDF]

open access: yes, 2012
We consider the polynomial representation S(V*) of the rational Cherednik algebra H_c(W) associated to a finite Coxeter group W at constant parameter c.
Feigin, M., Silantyev, A.
core   +1 more source

The complexity of the characteristic and the minimal polynomial

open access: yesTheoretical Computer Science, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Thanh Minh Hoang, Thomas Thierauf
openaire   +2 more sources

Vanishing Results for Hall-Littlewood Polynomials [PDF]

open access: yes, 2012
It is well-known that if one integrates a Schur function indexed by a partition λ over the symplectic (resp. orthogonal) group, the integral vanishes unless all parts of λ have even multiplicity (resp. all parts of λ are even).
Venkateswaran, Vidya
core   +1 more source

Extremal Bicyclic Graphs with Respect to Permanental Sums and Hosoya Indices

open access: yesAxioms
Graph polynomials is one of the important research directions in mathematical chemistry. The coefficients of some graph polynomials, such as matching polynomial and permanental polynomial, are related to structural properties of graphs.
Tingzeng Wu, Yinggang Bai, Shoujun Xu
doaj   +1 more source

Noncommutative Phase Space Schrödinger Equation with Minimal Length

open access: yesAdvances in High Energy Physics, 2014
We consider the Schrödinger equation under an external magnetic field in two-dimensional noncommutative phase space with an explicit minimal length relation.
H. Hassanabadi   +2 more
doaj   +1 more source

On the Structure of Valiant's Complexity Classes [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 1999
In Valiant developed an algebraic analogue of the theory of NP-completeness for computations of polynomials over a field. We further develop this theory in the spirit of structural complexity and obtain analogues of well-known results by Baker, Gill, and
Peter Bürgisser
doaj   +3 more sources

Vector-Valued Jack Polynomials from Scratch

open access: yesSymmetry, Integrability and Geometry: Methods and Applications, 2011
Vector-valued Jack polynomials associated to the symmetric group S_N are polynomials with multiplicities in an irreducible module of S_N and which are simultaneous eigenfunctions of the Cherednik-Dunkl operators with some additional properties concerning
Jean-Gabriel Luque, Charles F. Dunkl
doaj   +1 more source

Minimal Polynomials in Finite Semifields [PDF]

open access: yesJournal of Siberian Federal University. Mathematics & Physics, 2018
Summary: We consider the classical notion of a minimal polynomial and apply it to investigations in finite semifields. A proper finite semifield has non-associative multiplication, that leads to a number of anomalous properties of one-side-ordered minimal polynomials.
openaire   +4 more sources

Ligand‐dependent transcriptional heterogeneity in cell cycle gene expression delays G1/S entry

open access: yesFEBS Letters, EarlyView.
EGF and HRG induce distinct G1/S progression programs in ErbB2‐amplified BT474 breast cancer cells. Despite activating the potent ErbB2–ErbB3 heterodimer, HRG does not accelerate cell‐cycle entry. Instead, EGF promotes earlier restriction‐point passage via ERK–FOS signaling, whereas HRG activates the AKT–MYC axis, driving transcriptional heterogeneity ...
Ririn Rahmala Febri   +5 more
wiley   +1 more source

Home - About - Disclaimer - Privacy