skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Primitivity rank for random elements in free groups
Abstract For a free group F r F_{r} of finite rank r ≥ 2 r\geq 2 and a non-trivial element w ∈ F r w\in F_{r} , the primitivity rank π ⁢ ( w ) \pi(w) is the smallest rank of a subgroup H ≤ F r H\leq F_{r} such that w ∈ H w\in H and 𝑤 is not primitive in 𝐻 (if no such 𝐻 exists, one puts π ⁢ ( w ) = ∞ \pi(w)=\infty ).The set of all subgroups of F r F_{r} of rank π ⁢ ( w ) \pi(w) containing 𝑤 as a non-primitive element is denoted by Crit ⁡ ( w ) \operatorname{Crit}(w) .These notions were introduced by Puder (2014).We prove that there exists an exponentially generic subset V ⊆ F r V\subseteq F_{r} such that, for every w ∈ V w\in V , we have π ⁢ ( w ) = r \pi(w)=r and Crit ⁡ ( w ) = { F r } \operatorname{Crit}(w)=\{F_{r}\} .  more » « less
Award ID(s):
1905641
PAR ID:
10371735
Author(s) / Creator(s):
Date Published:
Journal Name:
Journal of Group Theory
Volume:
0
Issue:
0
ISSN:
1433-5883
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; (, Journal für die reine und angewandte Mathematik (Crelles Journal))
    Abstract Let M be a complete Riemannian manifold and suppose {p\in M} . For each unit vector {v\in T_{p}M} , the Jacobi operator , {\mathcal{J}_{v}:v^{\perp}\rightarrow v^{\perp}} is the symmetric endomorphism, {\mathcal{J}_{v}(w)=R(w,v)v} . Then p is an isotropic point if there exists a constant {\kappa_{p}\in{\mathbb{R}}} such that {\mathcal{J}_{v}=\kappa_{p}\operatorname{Id}_{v^{\perp}}} for each unit vector {v\in T_{p}M} . If all points are isotropic, then M is said to be isotropic; it is a classical result of Schur that isotropic manifolds of dimension at least 3 have constant sectional curvatures. In this paper we consider almost isotropic manifolds , i.e. manifolds having the property that for each {p\in M} , there exists a constant {\kappa_{p}\in\mathbb{R}} such that the Jacobi operators {\mathcal{J}_{v}} satisfy {\operatorname{rank}({\mathcal{J}_{v}-\kappa_{p}\operatorname{Id}_{v^{\perp}}}% )\leq 1} for each unit vector {v\in T_{p}M} . Our main theorem classifies the almost isotropic simply connected Kähler manifolds, proving that those of dimension {d=2n\geqslant 4} are either isometric to complex projective space or complex hyperbolic space or are totally geodesically foliated by leaves isometric to {{\mathbb{C}}^{n-1}} . 
    more » « less
  2. ; ; ; ; (, Monthly Notices of the Royal Astronomical Society)
    ABSTRACT Previous studies of fueling black holes in galactic nuclei have argued (on scales $${\sim}0.01{-}1000\,$$pc) accretion is dynamical with inflow rates $$\dot{M}\sim \eta \, M_{\rm gas}/t_{\rm dyn}$$ in terms of gas mass Mgas, dynamical time tdyn, and some η. But these models generally neglected expulsion of gas by stellar feedback, or considered extremely high densities where expulsion is inefficient. Studies of star formation, however, have shown on sub-kpc scales the expulsion efficiency fwind = Mejected/Mtotal scales with the gravitational acceleration as $$(1-f_{\rm wind})/f_{\rm wind}\sim \bar{a}_{\rm grav}/\langle \dot{p}/m_{\ast }\rangle \sim \Sigma _{\rm eff}/\Sigma _{\rm crit}$$ where $$\bar{a}_{\rm grav}\equiv G\, M_{\rm tot}(\lt r)/r^{2}$$ and $$\langle \dot{p}/m_{\ast }\rangle$$ is the momentum injection rate from young stars. Adopting this as the simplest correction for stellar feedback, $$\eta \rightarrow \eta \, (1-f_{\rm wind})$$, we show this provides a more accurate description of simulations with stellar feedback at low densities. This has immediate consequences, predicting the slope and normalization of the MBH − σ and MBH − Mbulge relation, LAGN −SFR relations, and explanations for outliers in compact Es. Most strikingly, because star formation simulations show expulsion is efficient (fwind ∼ 1) below total-mass surface density $$M_{\rm tot}/\pi \, r^{2}\lt \Sigma _{\rm crit}\sim 3\times 10^{9}\, \mathrm{M}_{\odot }\, {\rm kpc^{-2}}$$ (where $$\Sigma _{\rm crit}=\langle \dot{p}/m_{\ast }\rangle /(\pi \, G)$$), BH mass is predicted to specifically trace host galaxy properties above a critical surface brightness Σcrit (B-band $$\mu _{\rm B}^{\rm crit}\sim 19\, {\rm mag\, arcsec^{-2}}$$). This naturally explains why BH masses preferentially reflect bulge properties or central surface densities (e.g. $$\Sigma _{1\, {\rm kpc}}$$), not ‘total’ galaxy properties. 
    more » « less
  3. (, AKCE International Journal of Graphs and Combinatorics)
    A k-ranking of a graph G is a labeling with k labels such that if f(u) = f(v) then every uv path contains a vertex w such that f(w) > f(u). The rank number of G, denoted Xr (G), is the minimum k such that a k-ranking exists for G. In this paper we characterize graphs with large rank numbers. In addition, we characterize subdivided stars based on their rank numbers. 
    more » « less
  4. ; (, ACM Transactions on Algorithms)
    An \ell _p oblivious subspace embedding is a distribution over r \times n matrices \Pi such that for any fixed n \times d matrix A , \[ \Pr _{\Pi }[\textrm {for all }x, \ \Vert Ax\Vert _p \le \Vert \Pi Ax\Vert _p \le \kappa \Vert Ax\Vert _p] \ge 9/10,\] where r is the dimension of the embedding, \kappa is the distortion of the embedding, and for an n -dimensional vector y , \Vert y\Vert _p = (\sum _{i=1}^n |y_i|^p)^{1/p} is the \ell _p -norm. Another important property is the sparsity of \Pi , that is, the maximum number of non-zero entries per column, as this determines the running time of computing \Pi A . While for p = 2 there are nearly optimal tradeoffs in terms of the dimension, distortion, and sparsity, for the important case of 1 \le p \lt 2 , much less was known. In this article, we obtain nearly optimal tradeoffs for \ell _1 oblivious subspace embeddings, as well as new tradeoffs for 1 \lt p \lt 2 . Our main results are as follows: (1) We show for every 1 \le p \lt 2 , any oblivious subspace embedding with dimension r has distortion \[ \kappa = \Omega \left(\frac{1}{\left(\frac{1}{d}\right)^{1 / p} \log ^{2 / p}r + \left(\frac{r}{n}\right)^{1 / p - 1 / 2}}\right).\] When r = {\operatorname{poly}}(d) \ll n in applications, this gives a \kappa = \Omega (d^{1/p}\log ^{-2/p} d) lower bound, and shows the oblivious subspace embedding of Sohler and Woodruff (STOC, 2011) for p = 1 is optimal up to {\operatorname{poly}}(\log (d)) factors. (2) We give sparse oblivious subspace embeddings for every 1 \le p \lt 2 . Importantly, for p = 1 , we achieve r = O(d \log d) , \kappa = O(d \log d) and s = O(\log d) non-zero entries per column. The best previous construction with s \le {\operatorname{poly}}(\log d) is due to Woodruff and Zhang (COLT, 2013), giving \kappa = \Omega (d^2 {\operatorname{poly}}(\log d)) or \kappa = \Omega (d^{3/2} \sqrt {\log n} \cdot {\operatorname{poly}}(\log d)) and r \ge d \cdot {\operatorname{poly}}(\log d) ; in contrast our r = O(d \log d) and \kappa = O(d \log d) are optimal up to {\operatorname{poly}}(\log (d)) factors even for dense matrices. We also give (1) \ell _p oblivious subspace embeddings with an expected 1+\varepsilon number of non-zero entries per column for arbitrarily small \varepsilon \gt 0 , and (2) the first oblivious subspace embeddings for 1 \le p \lt 2 with O(1) -distortion and dimension independent of n . Oblivious subspace embeddings are crucial for distributed and streaming environments, as well as entrywise \ell _p low-rank approximation. Our results give improved algorithms for these applications. 
    more » « less
  5. (, Dissertation)
    F or c e d at a f or a fl a p pi n g f oil e n er g y h ar v e st er wit h a cti v e l e a di n g e d g e m oti o n o p er ati n g i n t h e l o w r e d u c e d fr e q u e n c y r a n g e i s c oll e ct e d t o d et er mi n e h o w l e a di n g e d g e m oti o n aff e ct s e n er g y h ar v e sti n g p erf or m a n c e. T h e f oil pi v ot s a b o ut t h e mi dc h or d a n d o p er at e s i n t h e l o w r e d u c e d fr e q u e n c y r a n g e of 𝑓𝑓 𝑓𝑓 / 𝑈𝑈 ∞ = 0. 0 6 , 0. 0 8, a n d 0. 1 0 wit h 𝑅𝑅 𝑅𝑅 = 2 0 ,0 0 0 − 3 0 ,0 0 0 , wit h a pit c hi n g a m plit u d e of 𝜃𝜃 0 = 7 0 ∘ , a n d a h e a vi n g a m plit u d e of ℎ 0 = 0. 5 𝑓𝑓 . It i s f o u n d t h at l e a di n g e d g e m oti o n s t h at r e d u c e t h e eff e cti v e a n gl e of att a c k e arl y t h e str o k e w or k t o b ot h i n cr e a s e t h e lift f or c e s a s w ell a s s hift t h e p e a k lift f or c e l at er i n t h e fl a p pi n g str o k e. L e a di n g e d g e m oti o n s i n w hi c h t h e eff e cti v e a n gl e of att a c k i s i n cr e a s e d e arl y i n t h e str o k e s h o w d e cr e a s e d p erf or m a n c e. I n a d diti o n a di s cr et e v ort e x m o d el wit h v ort e x s h e d di n g at t h e l e a di n g e d g e i s i m pl e m e nt f or t h e m oti o n s st u di e d; it i s f o u n d t h at t h e m e c h a ni s m f or s h e d di n g at t h e l e a di n g e d g e i s n ot a d e q u at e f or t hi s p ar a m et er r a n g e a n d t h e m o d el c o n si st e ntl y o v er pr e di ct s t h e a er o d y n a mi c f or c e s. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email