Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn the question Can one hear the shape of a group? and Hulanicki type theorem for graphs
105
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We study the question of whether it is possible to determine a finitely generated group $G$ up to some notion of equivalence from the spectrum $mathrm{sp}(G)$ of $G$. We show that the answer is No in a strong sense. As the first example we present the collection of amenable 4-generated groups $G_omega$, $omegain{0,1,2}^mathbb N$, constructed by the second author in 1984. We show that among them there is a continuum of pairwise non-quasi-isometric groups with $mathrm{sp}(G_omega)=[-tfrac{1}{2},0]cup[tfrac{1}{2},1]$. Moreover, for each of these groups $G_omega$ there is a continuum of covering groups $G$ with the same spectrum. As the second example we construct a continuum of $2$-generated torsion-free step-3 solvable groups with the spectrum $[-1,1]$. In addition, in relation to the above results we prove a version of Hulanicki Theorem about inclusion of spectra for covering graphs.
rate research
Read More
We show that the spectrum of the Schrodinger operator on a finite, metric graph determines uniquely the connectivity matrix and the bond lengths, provided that the lengths are non-commensurate and the connectivity is simple (no parallel bonds between vertices and no loops connecting a vertex to itself). That is, one can hear the shape of the graph! We also consider a related inversion problem: A compact graph can be converted into a scattering system by attaching to its vertices leads to infinity. We show that the scattering phase determines uniquely the compact part of the graph, under similar conditions as above.
Neural network applications have become popular in both enterprise and personal settings. Network solutions are tuned meticulously for each task, and designs that can robustly resolve queries end up in high demand. As the commercial value of accurate and performant machine learning models increases, so too does the demand to protect neural architectures as confidential investments. We explore the vulnerability of neural networks deployed as black boxes across accelerated hardware through electromagnetic side channels. We examine the magnetic flux emanating from a graphics processing units power cable, as acquired by a cheap $3 induction sensor, and find that this signal betrays the detailed topology and hyperparameters of a black-box neural network model. The attack acquires the magnetic signal for one query with unknown input values, but known input dimensions. The network reconstruction is possible due to the modular layer sequence in which deep neural networks are evaluated. We find that each layer components evaluation produces an identifiable magnetic signal signature, from which layer topology, width, function type, and sequence order can be inferred using a suitably trained classifier and a joint consistency optimization based on integer programming. We study the extent to which network specifications can be recovered, and consider metrics for comparing network similarity. We demonstrate the potential accuracy of this side channel attack in recovering the details for a broad range of network architectures, including random designs. We consider applications that may exploit this novel side channel exposure, such as adversarial transfer attacks. In response, we discuss countermeasures to protect against our method and other similar snooping techniques.
In 1878, Jordan proved that if a finite group $G$ has a faithful representation of dimension $n$ over $mathbb{C}$, then $G$ has a normal abelian subgroup with index bounded above by a function of $n$. The same result fails if one replaces $mathbb{C}$ by a field of positive characteristic, due to the presence of large unipotent and/or Lie type subgroups. For this reason, a long-standing problem in group and representation theory has been to find the correct analogue of Jordans theorem in characteristic $p>0$. Progress has been made in a number of different directions, most notably by Brauer and Feit in 1966; by Collins in 2008; and by Larsen and Pink in 2011. With a 1968 theorem of Steinberg in mind (which shows that a significant proportion of elements in a simple group of Lie type are unipotent), we prove in this paper that if a finite group $G$ has a faithful representation over a field of characteristic $p$, then a significant proportion of the elements of $G$ must have $p$-power order. We prove similar results for permutation groups, and present a general method for counting $p$-elements in finite groups. All of our results are best possible.
This note is devoted to the theory of projective limits of finite-dimensional Lie groups, as developed in the recent monograph ``The Lie Theory of Connected Pro-Lie Groups by K.H. Hofmann and S.A. Morris. We replace the original, highly non-trivial proof of the One-Parameter Subgroup Lifting Lemma given in the monograph by a shorter and more elementary argument. Furthermore, we shorten (and correct) the proof of the so-called Pro-Lie Group Theorem, which asserts that pro-Lie groups and projective limits of Lie groups coincide.
We give a complete characterization of the relationship between the shape of a Euclidean polygon and the symbolic dynamics of its billiard flow. We prove that the only pairs of tables that can have the same bounce spectrum are right-angled tables that differ by an affine map. The main tool is a new theorem that establishes that a flat cone metric is completely determined by the support of its Liouville current.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
