Results 201 to 210 of about 309,815 (270)

Counting problems for orthogonal sets and sublattices in function fields

open access: yesMathematika, Volume 72, Issue 2, April 2026.
Abstract Let K=Fq((x−1))$\mathcal {K}=\mathbb {F}_q((x^{-1}))$. Analogous to orthogonality in the Euclidean space Rn$\mathbb {R}^n$, there exists a well‐studied notion of ultrametric orthogonality in Kn$\mathcal {K}^n$. In this paper, we extend the work of [4] on counting problems related to orthogonality in Kn$\mathcal {K}^n$.
Noy Soffer Aranov, Angelot Behajaina
wiley   +1 more source

A note on the Steinitz lemma

open access: yesMathematika, Volume 72, Issue 2, April 2026.
Abstract We establish the connection between the Steinitz problem for ordering vector families in arbitrary norms and its variant for not necessarily zero‐sum families consisting of “nearly unit” vectors.
Gergely Ambrus, Rainie Heck
wiley   +1 more source

A Biophysical Approach to the Design of Networks of Communication Systems

open access: yesMathematical Methods in the Applied Sciences, Volume 49, Issue 5, Page 4539-4547, 30 March 2026.
ABSTRACT Inspired by the growth dynamics of the protist Physarum polycephalum, we employ a formalism that describes adaptive, incompressible Hagen‐Poiseuille flows on channel networks to identify graphs connecting different nodes within Euclidean space. These graphs are either suboptimal or optimal relative to their length.
Rodrigo Almeida   +2 more
wiley   +1 more source

Algebraic Multigrid Based Preconditioning Approaches for Generalized Continuum Models and Indirect Displacement Control Techniques

open access: yesInternational Journal for Numerical Methods in Engineering, Volume 127, Issue 6, 30 March 2026.
ABSTRACT The contribution deals with algebraic multigrid (AMG) based preconditioning methods for the iterative solution of a coupled linear system of equations arising in numerical simulations of failure of quasi‐brittle materials using generalized continuum approaches.
Nasser Alkmim   +4 more
wiley   +1 more source

Home - About - Disclaimer - Privacy