Results 41 to 50 of about 1,463,977 (153)
ABSTRACT In an effort to understand the complexity of the maximum independent set problem, Chvátal introduced t‐perfect graphs. While a full characterization of this class remains open, important progress has been made for claw‐free graphs [Bruhn and Stein, Math. Program. 2012] and P 5‐free graphs [Bruhn and Fuchs, SIAM J. Discrete Math. 2017]. We take
Yixin Cao, Shenghua Wang
wiley +1 more source
Tree Independence Number III. Thetas, Prisms and Stars
ABSTRACT We prove that for every t ∈ N there exists τ = τ ( t ) ∈ N such that every (theta, prism, K 1 , t)‐free graph has tree independence number at most τ (where we allow “prisms” to have one path of length zero).
Maria Chudnovsky +2 more
wiley +1 more source
Spreadsheets, graphics calculators and mathematics education [PDF]
Over recent years, spreadsheets have been increasingly recognised as having a role in teaching and learning mathematics, but have continued to suffer the limitation of requiring access to computers. This paper summarises some of the potential benefits of
Kissane, B.
core
On the automorphisms of the power semigroups of a numerical semigroup
Abstract If H$H$ is a numerical semigroup (i.e., a cofinite subset of the non‐negative integers closed under addition), then the collection of all non‐empty subsets of H$H$ forms a semigroup P(H)$\mathcal {P}(H)$ under the sumset operation induced by addition in H$H$.
Salvatore Tringali, Kerou Wen
wiley +1 more source
Abstract Background Treating multiple brain metastases simultaneously with single‐isocenter multi‐target (SIMT) stereotactic radiosurgery (SRS) can streamline treatment planning and delivery. However, it can also result in targets at large distances from the isocenter, increasing sensitivity to rotational setup errors and requiring wider collimator ...
Adam D. Yock +4 more
wiley +1 more source
Sortable Elements for Quivers with Cycles [PDF]
Each Coxeter element c of a Coxeter group W defines a subset of W called the c-sortable elements. The choice of a Coxeter element of W is equivalent to the choice of an acyclic orientation of the Coxeter diagram of W.
Speyer, David E., Reading, Nathan
core +1 more source
Linear Versus Centred Colouring via Pseudogrids
ABSTRACT A centred colouring of a graph is a vertex colouring in which every connected subgraph contains a vertex whose colour is unique and a linear colouring is a vertex colouring in which every (not‐necessarily induced) path contains a vertex whose colour is unique.
Prosenjit Bose +4 more
wiley +1 more source
This article investigates how persistent homology, persistent Laplacians, and persistent commutative algebra reveal complementary geometric, topological, and algebraic invariants or signatures of real‐world data. By analyzing shapes, synthetic complexes, fullerenes, and biomolecules, the article shows how these mathematical frameworks enhance ...
Yiming Ren, Guo‐Wei Wei
wiley +1 more source
Seventh European Conference on Combinatorics, Graph Theory and Applications
In the tradition of EuroComb'01 (Barcelona), Eurocomb'03 (Prague), EuroComb'05 (Berlin), Eurocomb'07 (Seville), Eurocomb'09 (Bordeaux), and Eurocomb'11 (Budapest), this volume covers recent advances in combinatorics and graph theory including ...
Nešetřil, Jaroslav, Pellegrini, Marco
core +1 more source
Utterance evolution: the road to generative, combinatorial communicators
ABSTRACT Language has long been considered uniquely complex in the animal kingdom; however, animal research over the last decade has begun to challenge some long‐standing premises about exactly which language capacities are uniquely human. The task of resolving why and how complex communication systems evolve, particularly human language, has ...
Catherine Crockford +2 more
wiley +1 more source

