Results 111 to 120 of about 144,275 (215)
Random Structures &Algorithms, Volume 68, Issue 3, May 2026.ABSTRACT Binary search trees (BSTs) are fundamental data structures whose performance is largely governed by tree height. We introduce a block model for constructing BSTs by embedding internal BSTs into the nodes of an external BST—a structure motivated by parallel data architectures—corresponding to composite permutations formed via Kronecker or ...
John Peca‐Medlin, Chenyang Zhong
wiley +1 more source
Finding Long Cycles in Percolated Expander Graphs
Random Structures &Algorithms, Volume 68, Issue 3, May 2026.ABSTRACT Given a graph G$$ G $$, the percolated graph Gp$$ {G}_p $$ is formed by retaining each edge independently with probability p$$ p $$. Collares, Diskin, Erde, and Krivelevich initiated the study of large structures in percolated single‐scale vertex‐expander graphs, wherein every set of exactly k$$ k $$ vertices of G$$ G $$ has at least dk$$ dk $$
Lawrence Hollom
wiley +1 more source
Generating Functions For Kernels of Digraphs (Enumeration & Asymptotics for Nim Games)
, 2004 In this article, we study directed graphs (digraphs) with a coloring constraint due to Von Neumann and related to Nim-type games. This is equivalent to the notion of kernels of digraphs, which appears in numerous fields of research such as game theory ...
Banderier, Cyril +2 more
core +1 more source
Earth and Space Science, Volume 13, Issue 5, May 2026.Abstract This paper summarizes an evaluation by experts of how coordination of Earth‐observing Synthetic Aperture Radar (SAR) missions among the world's space agencies could advance toward game‐changing scientific discoveries and fully realizing SAR's practical capability to address many issues facing society.
Cathleen E. Jones +21 more
wiley +1 more source
BarekengThe rainbow connection was first introduced by Chartrand in 2006 and then in 2009 Krivelevich and Yuster first time introduced the rainbow vertex connection. Let graph be a connected graph.
Muhammad Ilham Nurfaizi Annadhifi +3 more
doaj +1 more source
Cognitive Science, Volume 50, Issue 5, May 2026.Abstract Although psycho‐/neuro‐linguistics has assumed a distinction between morphological and syntactic structure building as in traditional theoretical linguistics, this distinction has been increasingly challenged by theoretical linguists in recent years.
Xinchi Yu +3 more
wiley +1 more source
Which singular tangent bundles are isomorphic?
Journal of the London Mathematical Society, Volume 113, Issue 5, May 2026.Abstract Logarithmic and b$ b$‐tangent bundles provide a versatile framework for addressing singularities in geometry. Introduced by Deligne and Melrose, these modified bundles resolve singularities by reframing singular vector fields as well‐behaved sections of these singular bundles.
Eva Miranda, Pablo Nicolás
wiley +1 more source
Entrywise transforms preserving matrix positivity and nonpositivity
Journal of the London Mathematical Society, Volume 113, Issue 5, May 2026.Abstract We characterize real and complex functions which, when applied entrywise to square matrices, yield a positive definite matrix if and only if the original matrix is positive definite. We refer to these transformations as sign preservers. Compared to the classical work on entrywise preservers by Schoenberg and others, we completely resolve this ...
Dominique Guillot +3 more
wiley +1 more source
Computing and Combinatorics [PDF]
Algorithmica, 2016 Zhipeng Cai 0001, Alexander Zelikovsky
openaire +1 more source
The combinatorics of Motzkin polyominoes
Discrete Applied MathematicsA word $w=w_1\cdots w_n$ over the set of positive integers is a Motzkin word whenever $w_1=\texttt{1}$, $1\leq w_k\leq w_{k-1}+1$, and $w_{k-1}\neq w_{k}$ for $k=2, \dots, n$. It can be associated to a $n$-column Motzkin polyomino whose $i$-th column contains $w_i$ cells, and all columns are bottom-justified.
Baril, Jean-Luc +3 more
openaire +3 more sources