Results 11 to 20 of about 169 (106)
Normal Subgroup Growth of Linear Groups: the (G2; F4;E8)-Theorem
Let G be a finitely generated group and M_n(G) the number of its normal subgroup subgroups of index at most n. For linear groups G we show that M_n(G) can grow polynomially in n only if the semisimple part of the Zariski closure of G has simple components only of type G2, F4 or E8 (and in this case indeed this can happened!)
Larsen, Michael, Lubotzky, Alexander
openaire +2 more sources
Functional equations for zeta functions of groups and rings
We introduce a new method to compute explicit formulae for various zeta functions associated to groups and rings. The specific form of these formulae enables us to deduce local functional equations. More precisely, we prove local functional equations for
Voll, C., Voll, Christopher
core +1 more source
Product set growth in virtual subgroups of mapping class groups
We study product set growth in groups with acylindrical actions on quasi-trees and, more generally, hyperbolic spaces. As a consequence, we show that for every surface $S$ of finite type, there exist $\alpha,\beta>0$ such that for any finite symmetric ...
Kerr, Alice
core
Acylindrical hyperbolicity of groups acting on trees
We provide new examples of acylindrically hyperbolic groups arising from actions on simplicial trees. In particular, we consider amalgamated products and HNN-extensions, 1-relator groups, automorphism groups of polynomial algebras, 3-manifold groups and ...
Osin, Denis +3 more
core +1 more source
This note is a follow-up on the paper [A. Borel, G. Harder, Existence of discrete cocompact subgroups of reductive groups over local fields, J. Reine Angew. Math. 298 (1978) 53–64] of A. Borel and G.
Prasad, Gopal, Rapinchuk, Andrei S.
core +1 more source
A Coarse Geometric Approach to Graph Layout Problems
ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang +3 more
wiley +1 more source
Renormalization techniques for inflation systems and some of their applications
In this work, renormalization methods for quantities related to the diffraction of inflation systems are surveyed.Exact renormalization techniques are important and powerful, particularly for inflation‐generated systems. We review recent results in this direction.
Michael Baake +4 more
wiley +1 more source
A tutorial on Bayesian model averaging for exponential random graph models
Abstract The use of exponential random graph models (ERGMs) is becoming prevalent in psychology due to their ability to explain and predict the formation of edges between vertices in a network. Valid inference with ERGMs requires correctly specifying endogenous and exogenous effects as network statistics, guided by theory, to represent the network ...
Ihnwhi Heo +2 more
wiley +1 more source
Textile and colour defect detection using deep learning methods
Abstract Recent advances in deep learning (DL) have significantly enhanced the detection of textile and colour defects. This review focuses specifically on the application of DL‐based methods for defect detection in textile and coloration processes, with an emphasis on object detection and related computer vision (CV) tasks.
Hao Cui +2 more
wiley +1 more source
Universalism: an 11‐year longitudinal study
Abstract How individuals make trade‐offs between socially proximate or distant groups impacts upon a wide range of social, political and economic behaviours. This paper exploits Norwegian administrative register data over the 2012–2022 period to assess whether, and if so how, such ‘(moral) universalism’ develops as individuals age and go through major ...
Christine Bangum +2 more
wiley +1 more source

