Results 71 to 80 of about 1,778 (223)
Coded distributed computing enables efficient and fault-tolerant execution of large-scale linear algebra tasks, but introduces new privacy risks when routing decisions depend on encoded data.
Malihe Aliasgari
doaj +1 more source
This manuscript presents set-theoretical solutions to the Yang–Baxter equation within the framework of GE-algebras by constructing mappings that satisfy the braid condition and exploring the algebraic properties of GE-algebras. Detailed proofs and the use of left and right translation operators are provided to analyze these algebraic interactions ...
Ibrahim Senturk +5 more
openaire +2 more sources
This article provides important geometric formulas for node‐centered, edge‐based schemes in any number of dimensions. These formulas are noteworthy, as they do not require the explicit formation of dual regions. We prove several key geometric results, with a particular focus on the four‐dimensional case, due to potential space‐time applications ...
Nicholas Tufillaro +2 more
wiley +1 more source
Subspace Acceleration for Efficient Nonlinear Water Wave Simulation
We introduce an exponentially weighted subspace acceleration technique to reduce GMRES iterations for solving the Poisson equation with time‐dependent coefficients in nonlinear, dispersive free‐surface flows governed by the incompressible Navier‐Stokes equations. The method significantly reduces memory requirements and computational complexity compared
Rasmus Kleist Hørlyck Sørensen +3 more
wiley +1 more source
A New Fixed‐Point Framework for Nonexpansive and Averaged Mappings in Normed GE‐Algebras
In this paper, we develop a systematic framework for studying fixed‐point theory in the setting of normed GE‐algebras. Building on the GE‐norm, we introduce and analyze nonexpansive mappings, α ‐averaged mappings, and enriched contractions with respect to the quasimetric induced by the GE ...
Prashant Patel +2 more
openaire +1 more source
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
On the maximal Aa -index of graphs with a prescribed number of edges
For any real number α∈[0,1]\alpha \in \left[\mathrm{0,1}], by the Aα{A}_{\alpha }-matrix of a graph GG, we mean the matrix Aα(G)=αD(G)+(1−α)A(G){A}_{\alpha }\left(G)=\alpha D\left(G)+\left(1-\alpha )A\left(G), where A(G)A\left(G) and D(G)D\left(G) are ...
Chang Ting-Chung, Tam Bit-Shun
doaj +1 more source
ABSTRACT Capsets are subsets of F 3 n ${{\mathbb{F}}}_{3}^{n}$ with no three points on a line, and a capset is complete if it is not a subset of a larger capset. We study some new constructions of capsets via algebraic equations over extensions of F 3 ${{\mathbb{F}}}_{3}$.
Cassie Grace, José Felipe Voloch
wiley +1 more source
Stable Cuts, NAC‐Colourings and Flexible Realisations of Graphs
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
Theory of Supercritical Coupling and Generalized Bound States in the Continuum
We develop a general theory of supercritical coupling and generalized bound states in the continuum (gBICs), revealing how interference between radiative and absorptive channels enables quality factors beyond conventional material‐loss limits. The framework unifies non‐Hermitian mode coupling, causality‐driven reactive interactions, and interference ...
Sergio Balestrieri +3 more
wiley +1 more source

