Results 31 to 40 of about 763 (151)
The superposition method for the reconstruction of food webs
Methods in Ecology and Evolution, EarlyView.Abstract Understanding trophic positions is essential for analysing complex food webs. While calculating these positions can be straightforward when feeding relationships and their proportions are known, determining diet coefficients traditionally requires substantial time and effort.
Ettore Barbieri, Naoto F. Ishikawa
wiley +1 more source
Word Associations in a Minoritised Language: The Case of Cymraeg (Welsh)
International Journal of Applied Linguistics, EarlyView.ABSTRACT As with many research strands in linguistics, word association (WA) literature is dominated by English language data. This paper (i) explores the extent to which methodologies developed to date are applicable to other languages—specifically, Welsh (Cymraeg)—and (ii) investigates what WA analysis can reveal about lexical organisation and ...
Tess Fitzpatrick +2 more
wiley +1 more source
Normal Minimal Cayley Digraphs of Abelian Groups
European Journal of Combinatorics, 2000 Let \(G\) be a finite abelian group (additively written) and \(0\) be the neutral element of \(G\). For any subset \(S\) of \(G-\{0\}\), we denote by \(C(G,S)\) the Cayley digraph assigned to the pair \(G\), \(S\). We say that \(C(G,S)\) is minimal if \(S\) is a minimal generating system of \(G\); moreover, \(C(G,S)\) is called normal if the left ...
Jixiang Meng, Bao Ying
openaire +1 more source
International Transactions in Operational Research, EarlyView.Abstract Artificial intelligence (AI)‐enabled digital technologies have the potential to transform agriculture by supporting decision‐making and automating operations. However, their limited adoptions and scholars’ atheoretical explorations constrain our understanding.
Guoqing Zhao +5 more
wiley +1 more source
Context‐free graphs and their transition groups
Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.Abstract Starting from context‐free inverse graphs, we introduce a new class of groups and study their structural properties. We establish closure properties, show that their coword problems are context‐free, analyze torsion elements, and realize them as subgroups of the asynchronous rational group.
Daniele D'Angeli +3 more
wiley +1 more source
A Note on Almost Moore Diagraphs of Degree Three
Journal of Mathematical and Fundamental Sciences, 2019 It is well known that Moore digraphs do not exist except for trivial cases (degree 1 or diameter 1), but there are digraphs of diameter two and arbitrary degree which miss the Moore bound by one.
Edy Tri Baskoro +2 more
doaj
Spanish‐Speaking Secondary Students Reading and Spelling in English as a Foreign Language
European Journal of Education, Volume 61, Issue 3, September 2026.ABSTRACT Proficiency in English reading and spelling is essential, as many professional environments require both spoken and written skills. Literacy development in English as a foreign language poses challenges for learners whose first language is transparent, such as Spanish, due to the complexity and inconsistency of English orthography.
Paz Suárez‐Coalla +3 more
wiley +1 more source
On a Ramsey–Turán variant of Roth's theorem
Bulletin of the London Mathematical Society, Volume 58, Issue 8, August 2026.Abstract A classical theorem of Roth states that the maximum size of a solution‐free set of a homogeneous linear equation L$\mathcal {L}$ in Fp$\mathbb {F}_p$ is o(p)$o(p)$ if and only if the sum of the coefficients of L$\mathcal {L}$ is 0. In this paper, we prove a Ramsey–Turán variant of Roth's theorem, with respect to a natural notion of “structured”
Matija Bucić +4 more
wiley +1 more source
Calculating higher digraph homotopy groups
Science China MathematicsAbstract We give the first tractable and systematic examples of nontrivial higher digraph homotopy groups. To do this, we define relative digraph homotopy groups and show that these satisfy a long exact sequence analogous to the relative homotopy groups of spaces.
Theriault, Stephen +3 more
openaire +2 more sources
The Automorphism Groups of Minimal Infinite Circulant Digraphs
European Journal of Combinatorics, 1997 Given a group \(G\), a directed graph \(X\) is called a digraph regular representation (DRR) of \(G\) if Aut\((X)\simeq G\) (as abstract groups) and the action of Aut\((X)\) on \(V(X)\) is that of a regular permutation group. It is well known that in this case \(X\) must be a Cayley digraph \(X(G,S)\) where \(S\subset G\) and \(\langle S\rangle=G ...
Jixiang Meng, Qiongxiang Huang
openaire +1 more source