Results 91 to 100 of about 169,932 (295)
Bidiagonal Decompositions and Accurate Computations for the Ballot Table and the Fibonacci Matrix
Numerical Linear Algebra with Applications, Volume 33, Issue 1, February 2026.ABSTRACT Riordan arrays include many important examples of matrices. Here we consider the ballot table and the Fibonacci matrix. For finite truncations of these Riordan arrays, we obtain bidiagonal decompositions. Using them, algorithms to solve key linear algebra problems for ballot tables and Fibonacci matrices with high relative accuracy are derived.
Jorge Ballarín +2 more
wiley +1 more source
A complex network perspective on brain disease
Biological Reviews, Volume 101, Issue 1, Page 364-399, February 2026.ABSTRACT If brain anatomy and dynamics have a complex network structure as it has become standard to posit, it is reasonable to assume that such a structure should play a key role not only in brain function but also in brain dysfunction. However, exactly how network structure is implicated in brain damage and whether at least some pathologies can be ...
David Papo, Javier M. Buldú
wiley +1 more source
The Gini Index in Algebraic Combinatorics and Representation Theory [PDF]
, 2022 Grant Kopitzke
openalex +1 more source
Microfluidic Droplet Generation Enabled by a Pressure Barrier Mechanism
Engineering Reports, Volume 8, Issue 1, January 2026.We present a droplet generation method in microfluidic devices based on hydrodynamic instabilities at air–water interfaces enabled by pressure barrier mechanism, resulting in rapid formation of polydisperse droplets without external fields or additional manipulation. By adjusting channel geometry and surface wettability, multiple jets form and coalesce
Mostafa Shojaeian, Ali Koşar
wiley +1 more source
The Combinatorics of Iterated Loop Spaces
, 2003 It is well known since Stasheff's work that 1-fold loop spaces can be described in terms of the existence of higher homotopies for associativity (coherence conditions) or equivalently as algebras of contractible non-symmetric operads.
Batanin, M. A.
core +1 more source
A focal boundary value problem for difference equations
International Journal of Mathematics and Mathematical Sciences, 1993 The eigenvalue problem in difference equations, (−1)n−kΔny(t)=λ∑i=0k−1pi(t)Δiy(t), with Δty(0)=0, 0≤i≤k, Δk+iy(T+1)=0, 0 ...
Cathryn Denny, Darrel Hankerson
doaj +1 more source
Steiner Triple Systems With High Discrepancy
Journal of Combinatorial Designs, Volume 34, Issue 1, Page 5-14, January 2026.ABSTRACT In this paper, we initiate the study of discrepancy questions for combinatorial designs. Specifically, we show that, for every fixed r ≥ 3 and n ≡ 1 , 3 ( mod 6 ), any r‐colouring of the triples on [ n ] admits a Steiner triple system of order n with discrepancy Ω ( n 2 ).
Lior Gishboliner +2 more
wiley +1 more source
Combinatorics of Chord Progressions [PDF]
, 2012 Color poster with text and diagrams.This study explored an overlap between combinatorics and music. The goal was to show chord progressions that are common to a specific collection of music, composer, or era.University of Wisconsin--Eau Claire Office of
Kiefer, Peter
core +1 more source
HeliyonThis study aims to analyze the application of the RBL-STEM learning model in improving students' financial literacy to control their consumptive behavior.
Sumarno +5 more
doaj +1 more source
Discussiones Mathematicae Graph Theory, 2019 The Turán number of a graph H, denoted by ex(n, H), is the maximum number of edges in any graph on n vertices which does not contain H as a subgraph. Let Pk denote the path on k vertices and let mPk denote m disjoint copies of Pk.
Lan Yongxin, Qin Zhongmei, Shi Yongtang
doaj +1 more source