Results 181 to 190 of about 22,980 (304)
InfoScience, EarlyView.Traditional light‐analyzing tools, known as spectrometers, are typically too bulky and expensive to fit into portable electronics like smartphones or wearables. In this study, we developed a microscopic, high‐performance spectrometer using a material called Indium Selenide combined with smart algorithms to accurately analyze light from the visible to ...
Jing Chen +8 more
wiley +1 more source
Journal of Applied Econometrics, EarlyView.ABSTRACT We present four novel tests of equal predictive accuracy and encompassing á Pitarakis (2023, 2025) for factor‐augmented regressions. Factors are estimated using cross‐section averages (CAs) of grouped series and our theoretical findings are empirically relevant: asymptotic normality, robustness to an overspecification of the number of factors,
Alessandro Morico, Ovidijus Stauskas
wiley +1 more source
Colourings of Uniform Group Divisible Designs and Maximum Packings
Journal of Combinatorial Designs, EarlyView.ABSTRACT A weak c $c$‐colouring of a design is an assignment of colours to its points from a set of c $c$ available colours, such that there are no monochromatic blocks. A colouring of a design is block‐equitable, if for each block, the number of points coloured with any available pair of colours differ by at most one.
Andrea C. Burgess +6 more
wiley +1 more source
Tannakian Categories and Linear Differential Algebraic Groups
, 2007 Tannaka's Theorem states that a linear algebraic group G is determined by the category of finite dimensional G-modules and the forgetful functor. We extend this result to linear differential algebraic groups by introducing a category corresponding to ...
Ovchinnikov, Alexey
core
Signed Projective Cubes, a Homomorphism Point of View
Journal of Graph Theory, EarlyView.ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen +2 more
wiley +1 more source
Solution of polynomial Lyapunov and Sylvester equations
, 2006 A two-variable polynomial approach to solve the one-variable polynomial Lyapunov and Sylvester equations is proposed. Lifting the problem from the one-variable to the two-variable context gives rise to associated lifted equations which live on finite ...
Peeters, Ralf, Rapisarda, Paolo
core
Stable Cuts, NAC‐Colourings and Flexible Realisations of Graphs
Journal of Graph Theory, EarlyView.ABSTRACT A (2‐dimensional) realisation of a graph G $G$ is a pair ( G , p ) $(G,p)$, where p $p$ maps the vertices of G $G$ to R 2 ${{\mathbb{R}}}^{2}$. A realisation is flexible if it can be continuously deformed while keeping the edge lengths fixed, and rigid otherwise.
Katie Clinch +5 more
wiley +1 more source
Stability issues in the discretization of stochastic differential equations
, 2018 The aim of this talk is the analysis of various stability issues for numerical methods designed to solve stochastic differential equations. We first aim to consider nonlinear Ito stochastic differential equations (SDE): under suitable regularity ...
Buckwar, Evelyn +3 more
core
A novel shifted Vieta-Lucas spectral collocation approach for multidimensional generalized Benjamin-Bona-Mahony-Burgers equations. [PDF]
Sci RepHafez RM +4 more
europepmc +1 more source