Improved exposition and corrections in hyperbolic group graphs.
problem Improving exposition and corrections in hyperbolic group graphs.
method No new method introduced, just corrections and minor changes.
result No new key result presented, just corrections and minor changes.
Study classifies singular foliations on complex plane, finding finite moduli space.
problem Classifying singular foliations on complex plane.
method Fixed topological invariants and computed moduli space using cohomology of group-graph.
result Proved moduli space has finite dimension under generic conditions.
AGG-UCB uses neural networks to optimize group behaviors in contextual bandits.
problem Optimizing group behaviors in contextual bandits with mutual impacts.
method Introduces Arm Group Graph (AGG) and AGG-UCB algorithm using neural networks and graph neural networks.
result Achieves near-optimal regret bound with over-parameterized neural networks.
Corrects a mistake in a theorem about hyperbolic groups.
problem A theorem about graphs of hyperbolic groups was weakened.
method Identified and corrected a mistake in the published paper.
result Proved a weaker result to correct the main theorem.
Explicit presentations found for asymptotically rigid mapping class groups.
problem Understanding the structure of asymptotically rigid mapping class groups.
method Using a graph of groups structure, we compute explicit presentations.
result Computed explicit presentations for asymptotically rigid mapping class groups of surfaces.
Researchers calculate the action dimension of various group structures.
problem Determining the minimum dimension of contractible manifolds with group actions.
method Computing the action dimension of specific group structures.
result Action dimensions computed for Artin groups, graph products, and aspherical complements.
Algorithm constructs JSJ decomposition for hyperbolic groups.
problem Constructing JSJ decompositions for hyperbolic groups.
method Combinatorial and geometric analysis of immersed cycles in CAT(0) square complexes.
result First algorithm with explicit time bound for JSJ decompositions.
Generic loxodromic elements are common in hyperbolic groups and grow linearly.
problem Counting generic elements in hyperbolic groups.
method Combinatorial conditions on graph products and relatively hyperbolic groups.
result Loxodromic elements are common and have linear growth in translation length.
Surveying connections between graph combinatorics and algebraic right-angled Artin groups.
problem Understanding the relationship between graph structures and algebraic properties of right-angled Artin groups.
method Analyzing the defining and extension graphs of right-angled Artin groups.
result Discovers connections to geometric group theory and complexity theory.
Study of infinite-type surfaces' automorphisms and graph structures.
problem Understanding automorphisms of infinite-type surfaces.
method Isomorphic mappings between extended mapping class groups and graph automorphism groups.
result Extended mapping class groups are isomorphic to graph automorphism groups.
Researchers prove the automorphism group of a sphere complex matches the mapping group of a graph.
problem Understanding the automorphisms of sphere complexes associated with graphs.
method Analyzing the group of proper homotopy equivalences and constructing an exhaustion of the sphere complex.
result The automorphism group of the sphere complex is isomorphic to the mapping group of the graph.
Study of limits of Cantor and \sier sets, showing homeomorphic spaces.
problem Understanding topological properties of certain geometric structures.
method Analyzing direct limits of embedded Cantor sets and \sier curves, showing homeomorphism.
result Morse boundaries of specific groups are homeomorphic to limits of Cantor and \sier sets.
Triangle Artin groups split as graphs of free groups under specific conditions.
problem Conditions for triangle Artin groups to split as graphs of free groups.
method Graph of free groups analysis and poly-free property proof.
result Triangle Artin groups split as graphs of free groups if and only if labels are greater than 5 and even.
Study excursions of geodesics in RAAGs and graph products, finding a log(n) max excursion.
problem Understanding geodesic excursions in RAAGs and graph products.
method Defined and studied excursions in subgroups of groups, focusing on right-angled Artin groups and graph products.
result Max excursion of generic geodesics in flat tends to log(n) for irreducible RAAGs.
This paper generalizes property (QT) to a broader class of groups.
problem Proving property (QT) for a wider range of groups.
method Using projection complex machinery and hierarchical hyperbolic groups.
result Established sufficient conditions for groups to have property (QT).
Graph cohomology solves symplectic problems in surface mapping groups.
problem Compute the symplectic decomposition of Torelli group and its cohomology.
method Graph cohomology and ideas from graph cohomology.
result Effective computation of the symplectic decomposition of the quadratic dual of the lower central series of the Torelli group.
New BO method tackles high-dimensional optimization with overlapping subsets.
problem Scaling Bayesian optimization to high dimensions.
method Additive models with overlapping groups, graph-based message passing algorithm.
result Empirically validated effectiveness on synthetic and real-world data.
Study on right-angled Coxeter groups and their geometric properties.
problem Characterizing the coarse geometry of right-angled Coxeter groups.
method Analyzing graph properties and applying geometric group theory.
result Proves properties of right-angled Coxeter groups, including quasi-isometry and divergence.
Continuous functions on graphs in Carnot groups satisfy a Burgers' type equation.
problem Characterizing CH1-regularity of graphs in Carnot groups of step 2. method Proving equivalence between distributional solutions of Burgers' type equations and CH1-regularity of graphs. result Continuous functions on graphs in Carnot groups of step 2 satisfy a Burgers' type equation in the distributional sense.
The paper studies actions on Bass-Serre trees and identifies new C∗-simple groups.
problem Investigating actions of fundamental groups on Bass-Serre trees and their C∗-algebraic properties. method Analyzing boundary actions of fundamental groups of graphs of groups on their Bass-Serre trees.
result Identification of new families of C∗-simple groups, including tubular groups and certain graphs of groups. A new model identifies genetic risk factors using gene-level priors.
problem Identifying genetic risk factors from nucleotide-level genetic variants.
method Sparse Group Lasso with Group-level Graph structure (SGLGG) model.
result SGLGG effectively identifies phenotype-associated risk SNPs.
New graph invariant shows complexity of surface graphs.
problem Identifying graphs induced by curve graphs of surfaces.
method Nested complexity length as a new graph invariant.
result Nested complexity length determines graphs in curve graphs.
Unified geometric principles unify neural network architectures.
problem High-dimensional learning tasks with underlying low-dimensionality and structure.
method Unified geometric principles applied to neural network architectures.
result Unified mathematical framework for neural network architectures.
Extends angular synchronization to heterogeneous groups, improving accuracy in multiple applications.
problem Recovering angles from noisy pairwise measurements in a heterogeneous setting.
method Probabilistic generative model and spectral algorithm with robustness analysis.
result Spectral algorithm provides improved recovery accuracy in various parameter regimes.