Results 81 to 90 of about 28,564 (220)
ABA and the combinatorics of morphological features
, 2018 In several three cell paradigms, it has been observed that one logically conceivable pattern – ABA under some arrangement of cells – is unattested. Existing approaches assume that such *ABA generalizations provide evidence for feature inventories which ...
J. Bobaljik, U. Sauerland
semanticscholar +1 more source
Variants of a theorem of Macbeath in finite‐dimensional normed spaces
Mathematika, Volume 72, Issue 2, April 2026.Abstract A classical theorem of Macbeath states that for any integers d⩾2$d \geqslant 2$, n⩾d+1$n \geqslant d+1$, d$d$‐dimensional Euclidean balls are hardest to approximate, in terms of volume difference, by inscribed convex polytopes with n$n$ vertices.
Zsolt Lángi, Shanshan Wang
wiley +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
Ordinary primes for GL2$\operatorname{GL}_2$‐type abelian varieties and weight 2 modular forms
Mathematika, Volume 72, Issue 2, April 2026.Abstract Let A$A$ be a g$g$‐dimensional abelian variety defined over a number field F$F$. It is conjectured that the set of ordinary primes of A$A$ over F$F$ has positive density, and this is known to be true when g=1,2$g=1, 2$, or for certain abelian varieties with extra endomorphisms.
Tian Wang, Pengcheng Zhang
wiley +1 more source
Mathematika, 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
JTAM (Jurnal Teori dan Aplikasi Matematika)Rainbow vertex antimagic coloring is a novel concept in graph theory that combines rainbow vertex connection with antimagic labeling. Rainbow vertex connection is a vertex coloring where each vertex in a simple connected graph G=(V,E) is connected by a ...
Dafik Dafik +5 more
doaj +1 more source
Engineering Cadherin‐Guided MSC Aggregates to Empower Synergistic Neurovascular Repair After Stroke
Aggregate, Volume 7, Issue 3, March 2026.A cadherin‐directed bioengineering strategy transforms mesenchymal stem cell aggregation from passive clustering into active functional programming. The resulting cadherin‐guided aggregates exhibit reinforced microstructure, stress resistance, and an enhanced pro‐regenerative secretome, enabling coordinated neurovascular repair in ischemic stroke.
Guoqiang Chen +8 more
wiley +1 more source
Conflict-Free Vertex-Connections of Graphs
Discussiones Mathematicae Graph Theory, 2020 A path in a vertex-colored graph is called conflict-free if there is a color used on exactly one of its vertices. A vertex-colored graph is said to be conflict-free vertex-connected if any two vertices of the graph are connected by a conflict-free path ...
Li Xueliang +5 more
doaj +1 more source
Simple 3‐Designs of PSL ( 2 , 2 n ) With Block Size 13
Journal of Combinatorial Designs, Volume 34, Issue 3, Page 119-138, March 2026.ABSTRACT This paper focuses on the investigation of simple 3‐( 2 n + 1 , 13 , λ ) designs admitting PSL ( 2 , 2 n ) as an automorphism group. Such designs arise from the orbits of 13‐element subsets under the action of PSL ( 2 , 2 n ) on the projective line X = GF ( 2 n ) ∪ { ∞ }, and any union of these orbits also forms a 3‐design.
Takara Kondo, Yuto Nogata
wiley +1 more source
Massive Spanning Forests on the Complete Graph: Exact Distribution and Local Limit
Random Structures &Algorithms, Volume 68, Issue 2, March 2026.ABSTRACT We provide new exact formulas for the distribution of massive spanning forests on the complete graph, which give also a new outlook on the celebrated special case of the uniform spanning tree. As a corollary we identify their local limit. This generalizes a well‐known theorem of Grimmett on the local limit of uniform spanning trees on the ...
Matteo D'Achille +2 more
wiley +1 more source