Results 91 to 100 of about 2,362 (196)
Context‐free graphs and their transition groups
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
Revealing job accessibility supported by public transit services using a graph convolutional network
Encouraging the use of public transit is widely recognized as a viable solution to address urban transportation issues such as increasing congestion and pollution.
Meihan Jin +4 more
doaj +1 more source
Quantum Circuit Optimization by Graph Coloring [PDF]
This work shows that minimizing the depth of a quantum circuit composed of commuting operations reduces to a vertex coloring problem on an appropriately constructed graph, where gates correspond to vertices and edges encode non-parallelizability.
Hochang Lee +2 more
doaj +1 more source
Surface subgroups for cocompact lattices of isometries of H2n$\mathbb {H}^{2n}$
Abstract We prove the existence of surface subgroups within any cocompact lattice Γ$\Gamma$ in SO(2n,1)$\mathrm{SO}(2n,1)$ for n⩾2$n\geqslant 2$. This result addresses the cases missing from the work of Hamenstädt in 2015, who constructed surface subgroups in cocompact lattices for all other rank‐1 simple Lie groups of noncompact type.
Jeremy Kahn, Zhenghao Rao
wiley +1 more source
What can graphs and algebraic structures say to each other?
In the last couple of decades, there has been a big upsurge of research on graphs defined on algebraic structures (groups, rings, vector spaces, semigroups, and others).
Peter J. Cameron
doaj +1 more source
Tripotent Divisor Graph of a Commutative Ring
In this work, we introduce a new concept called the tripotent divisor graph of a commutative ring. It is defined with vertices set in a ring R, where distinct vertices r1 and r2 are connected by an edge if their product belongs to the set of all nonunite tripotent in R. We denote this graph as 3I Γ(R).
Luma Ahmed Khaleel +2 more
openaire +2 more sources
On θ-commutators and the corresponding non-commuting graphs
Abstract The θ-commutators of elements of a group with respect to an automorphism are introduced and their properties are investigated. Also, corresponding to θ-commutators, we define the θ-non-commuting graphs of groups and study their correlations with other notions. Furthermore, we study independent sets in θ-non-commuting graphs, which enable us to
Shalchi S., Erfanian A., Farrokhi DG M.
openaire +2 more sources
Higher representation stability for ordered configuration spaces
Abstract Using factorization homology with coefficients in twisted commutative algebras (TCAs), we prove two flavors of higher representation stability for the cohomology of (generalized) configuration spaces of a scheme/topological space X$X$. First, we provide an iterative procedure to study higher representation stability using actions coming from ...
Quoc P. Ho
wiley +1 more source
Comparative Case Study of Small‐Scale Fish Processing for Local Seafood Supply
ABSTRACT This study examines the cost feasibility of local seafood processing as a market diversification strategy for small‐scale aquaculture producers in the US Midwest. It addresses a gap in the literature by moving beyond commercial processing and mass marketing of processed seafood to assess the cost profitability of niche local fish processing ...
Jingjing Tao, Kwamena K. Quagrainie
wiley +1 more source
Invariant Measure and Universality of the 2D Yang–Mills Langevin Dynamic
ABSTRACT We prove that the Yang–Mills (YM) measure for the trivial principal bundle over the two‐dimensional torus, with any connected, compact structure group, is invariant for the associated renormalised Langevin dynamic. Our argument relies on a combination of regularity structures, lattice gauge‐fixing and Bourgain's method for invariant measures ...
Ilya Chevyrev, Hao Shen
wiley +1 more source

