Results 41 to 50 of about 1,148,447 (292)

A two-variable approach to solve the polynomial Lyapunov equation

, 2001
A two-variable polynomial approach to solve the one-variable polynomial Lyapunov equation is proposed. Lifting the problem from the one-variable to the two-variable context allows to use Faddeev-type recursions in order to solve the polynomial Lyapunov ...
Peeters, Ralf, Rapisarda, Paolo
core   +2 more sources

Elevating PGBMain algorithm performance through strategic minimal Dickson basis selection [PDF]

Computational Algorithms and Numerical Dimensions
In this paper, we enhance the PGBMain algorithm, an efficient method for computing Gröbner bases of parametric polynomial ideals, or Gröbner systems. A key step in the PGBMain algorithm involves computing a minimal Dickson basis in each iteration, which ...
Mahdi Dehghani Darmian
doaj   +1 more source

Nonderogatory Unicyclic Digraphs

International Journal of Mathematics and Mathematical Sciences, 2007
A digraph is nonderogatory if its characteristic polynomial and minimal polynomial are equal. We find a characterization of nonderogatory unicyclic digraphs in terms of Hamiltonicity conditions.
Diego Bravo, Juan Rada
doaj   +1 more source

Minimal Polynomials in Finite Semifields [PDF]

Journal 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

FEBS 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, Ayaka Nagasato‐Ichikawa, Keita Iida, Shuhei Kimura, Akira Imamoto, Mariko Okada   +5 more
wiley   +1 more source

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number [PDF]

Discrete Mathematics & Theoretical Computer Science
In this note we show a polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number.
Marcin Pilipczuk, Paweł Rzążewski
doaj   +1 more source

GMRES and the minimal polynomial [PDF]

BIT Numerical Mathematics, 1996
A qualitative model is presented for the convergence behaviour of GMRES for solving nonsingular systems of linear equations \(Ax=b\) in finite and infinite dimensions. If the eigenvalues of the matrix \(A\) consist of a single cluster point plus outliers then the convergence factor is bounded by the cluster radius.
Campbell, S. L., Ipsen, I. C. F., Kelley, C. T., Meyer, C. D.   +3 more
openaire   +1 more source

Relationship Between Neurologic Symptoms and Signs and FMR1 Genotype in Premutation Carriers

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Background and Objectives Fragile X‐associated Tremor/Ataxia Syndrome (FXTAS) is the most severe late‐onset condition caused by a premutation in the FMR1 gene, characterized by expanded CGG triplet repeats of 55–200. Clinical presentations of FXTAS, including gait ataxia, kinetic tremor, cognitive decline, and rare Parkinsonism, are linked to ...
Flora Tassone, Freddy Chafota, Miguel E. Rentería, Randi J. Hagerman, Ellery Santos, Anna Atkinson, Nicholas G. Martin, Elsdon Storey, Danuta Z. Loesch   +8 more
wiley   +1 more source

Broadband angle of arrival estimation methods in a polynomial matrix decomposition framework [PDF]

, 2013
A large family of broadband angle of arrival estimation algorithms are based on the coherent signal subspace (CSS) method, whereby focussing matrices appropriately align covariance matrices across narrowband frequency bins.
Weiss, Stephan, McWhirter, John G., Lambotharan, Sangarapillai, Alrmah, Mohamed, Kaveh, Mostafa   +4 more
core   +4 more sources

Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints

Algorithms
In this paper, we consider the minimal vertex cover and minimal dominating sets with capacity and/or connectivity constraint enumeration problems. We develop polynomial-delay enumeration algorithms for these problems on bounded-degree graphs.
Yasuaki Kobayashi, Kazuhiro Kurita, Kevin Mann, Yasuko Matsui, Hirotaka Ono   +4 more
doaj   +1 more source