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.


Title: Disjointness of a Simple Matrix Lie Group and Its Lie Algebra
Award ID(s):
2001349
PAR ID:
10527969
Author(s) / Creator(s):
Publisher / Repository:
Springer Verlag
Date Published:
Journal Name:
Vietnam Journal of Mathematics
Volume:
52
Issue:
2
ISSN:
2305-221X
Page Range / eLocation ID:
445 to 450
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract For each prime 𝑝 and each positive integer 𝑑, we construct the first examples of second countable, topologically simple 𝑝-adic Lie groups of dimension 𝑑 whose Lie algebras are abelian.This answers several questions of Glƶckner and Caprace–Monod.The proof relies on a generalization of small cancellation methods that applies to central extensions of acylindrically hyperbolic groups. 
    more » « less
  2. This paper presents a control framework on Lie groups by designing the control objective in its Lie algebra. Control on Lie groups is challenging due to its nonlinear nature and difficulties in system parameterization. Existing methods to design the control objective on a Lie group and then derive the gradient for controller design are non-trivial and can result in slow convergence in tracking control. We show that with a proper left-invariant metric, setting the gradient of the cost function as the tracking error in the Lie algebra leads to a quadratic Lyapunov function that enables globally exponential convergence. In the PD control case, we show that our controller can maintain an exponential convergence rate even when the initial error is approaching Ļ€ in SO(3). We also show the merit of this proposed framework in trajectory optimization. The proposed cost function enables the iterative Linear Quadratic Regulator (iLQR) to converge much faster than the Differential Dynamic Programming (DDP) with a well-adopted cost function when the initial trajectory is poorly initialized on SO(3). 
    more » « less
  3. Trust is implicit in many online text conversations—striking up new friendships, or asking for tech support. But trust can be betrayed through deception. We study the language and dynamics of deception in the negotiation-based game Diplomacy, where seven players compete for world domination by forging and breaking alliances with each other. Our study with players from the Diplomacy community gathers 17,289 messages annotated by the sender for their intended truthfulness and by the receiver for their perceived truthfulness. Unlike existing datasets, this captures deception in long-lasting relationships, where the interlocutors strategically combine truth with lies to advance objectives. A model that uses power dynamics and conversational contexts can predict when a lie occurs nearly as well as human players. 
    more » « less