Results 41 to 50 of about 16,397 (156)
Equivariant geometry of singular cubic threefolds, II
Journal of the London Mathematical Society, Volume 112, Issue 1, July 2025.Abstract We study linearizability of actions of finite groups on cubic threefolds with nonnodal isolated singularities.
Ivan Cheltsov +3 more
wiley +1 more source
Structural properties of graph products
Journal of Graph Theory, Volume 109, Issue 2, Page 107-136, June 2025.Abstract Dujmovć, Joret, Micek, Morin, Ueckerdt, and Wood established that every planar graph is a subgraph of the strong product of a graph with bounded treewidth and a path. Motivated by this result, this paper systematically studies various structural properties of cartesian, direct and strong products.
Robert Hickingbotham, David R. Wood
wiley +1 more source
Profinite rigidity for free‐by‐cyclic groups with centre
Journal of the London Mathematical Society, Volume 111, Issue 6, June 2025.Abstract A free‐by‐cyclic group FN⋊ϕZ$F_N\rtimes _\phi \mathbb {Z}$ has non‐trivial centre if and only if [ϕ]$[\phi]$ has finite order in Out(FN)${\rm {Out}}(F_N)$. We establish a profinite rigidity result for such groups: if Γ1$\Gamma _1$ is a free‐by‐cyclic group with non‐trivial centre and Γ2$\Gamma _2$ is a finitely generated free‐by‐cyclic group ...
Martin R. Bridson, Paweł Piwek
wiley +1 more source
On profinite rigidity amongst free‐by‐cyclic groups I: The generic case
Proceedings of the London Mathematical Society, Volume 130, Issue 6, June 2025.Abstract We prove that amongst the class of free‐by‐cyclic groups, Gromov hyperbolicity is an invariant of the profinite completion. We show that whenever G$G$ is a free‐by‐cyclic group with first Betti number equal to one, and H$H$ is a free‐by‐cyclic group which is profinitely isomorphic to G$G$, the ranks of the fibres and the characteristic ...
Sam Hughes, Monika Kudlinska
wiley +1 more source
On the Ubiquity of Oriented Double Rays
Journal of Graph Theory, Volume 109, Issue 1, Page 62-67, May 2025.ABSTRACT A digraph H is called ubiquitous if every digraph that contains arbitrarily many vertex‐disjoint copies of H
wiley +1 more source
Genetic Algorithm-based Mapper to Support Multiple Concurrent Users on Wireless Testbeds
, 2016 Communication and networking research introduces new protocols and standards with an increasing number of researchers relying on real experiments rather than simulations to evaluate the performance of their new protocols.
Azmy, Michael +2 more
core +1 more source
On Rainbow Turán Densities of Trees
Random Structures &Algorithms, Volume 66, Issue 3, May 2025.ABSTRACT For a given collection 𝒢=(G1,…,Gk) of graphs on a common vertex set V$$ V $$, which we call a graph system, a graph H$$ H $$ on a vertex set V(H)⊆V$$ V(H)\subseteq V $$ is called a rainbow subgraph of 𝒢 if there exists an injective function ψ:E(H)→[k]$$ \psi :E(H)\to \left[k\right] $$ such that e∈Gψ(e)$$ e\in {G}_{\psi (e)} $$ for each e∈E(H)$$
Seonghyuk Im +3 more
wiley +1 more source
Generic root counts and flatness in tropical geometry
Journal of the London Mathematical Society, Volume 111, Issue 5, May 2025.Abstract We use tropical and nonarchimedean geometry to study the generic number of solutions of families of polynomial equations over a parameter space Y$Y$. In particular, we are interested in the choices of parameters for which the generic root count is attained.
Paul Alexander Helminck, Yue Ren
wiley +1 more source
The Temperley–Lieb tower and the Weyl algebra
Journal of the London Mathematical Society, Volume 111, Issue 5, May 2025.Abstract We define a monoidal category W${\mathbf {W}}$ and a closely related 2‐category 2Weyl${\mathbf {2Weyl}}$ using diagrammatic methods. We show that 2Weyl${\mathbf {2Weyl}}$ acts on the category TL:=⨁nTLn−mod$\mathbf {TL}:=\bigoplus _n \operatorname{TL}_n\mathrm{-mod}$ of modules over Temperley–Lieb algebras, with its generating 1‐morphisms ...
Matthew Harper, Peter Samuelson
wiley +1 more source
Reduction Techniques for Graph Isomorphism in the Context of Width Parameters
, 2014 We study the parameterized complexity of the graph isomorphism problem when parameterized by width parameters related to tree decompositions. We apply the following technique to obtain fixed-parameter tractability for such parameters. We first compute an
A. Bouland +15 more
core +1 more source