scholarly journals On exceptional Lie geometries

2021 ◽  
Vol 9 ◽  
Author(s):  
Anneleen De Schepper ◽  
Jeroen Schillewaert ◽  
Hendrik Van Maldeghem ◽  
Magali Victoor

Abstract Parapolar spaces are point-line geometries introduced as a geometric approach to (exceptional) algebraic groups. We characterize a wide class of Lie geometries as parapolar spaces satisfying a simple intersection property. In particular, many of the exceptional Lie incidence geometries occur. In an appendix, we extend our result to the locally disconnected case and discuss the locally disconnected case of some other well-known characterizations.

Author(s):  
D. H. A. Maithripala ◽  
D. H. S. Maithripala ◽  
S. Jayasuriya

We propose a framework for synthesizing real-time trajectories for a wide class of coordinating multi-agent systems. The class of problems considered is characterized by the ability to decompose a given formation objective into an equivalent set of lower dimensional problems. These include the so called radar deception problem and the formation control problems that fall under formation keeping and/or formation reconfiguration tasks. The decomposition makes the approach scalable, computationally economical, and decentralized. Most importantly, the designed trajectories are dynamically feasible, meaning that they maintain the formation while satisfying the nonholonomic and saturation type velocity and acceleration constraints of each individual agent. The main contributions of this paper are (i) explicit consideration of second order dynamics for agents, (ii) explicit consideration of nonholonomic and saturation type velocity and acceleration constraints, (iii) unification of a wide class of formation control problems, and (iv) development of a real-time, distributed, scalable, computationally economical motion planning algorithm.


Author(s):  
S. Buonchristiano ◽  
C. P. Rourke ◽  
B. J. Sanderson

1984 ◽  
Vol 45 (C6) ◽  
pp. C6-87-C6-94
Author(s):  
H. Reinhardt ◽  
R. Balian ◽  
Y. Alhassid

1989 ◽  
Vol 17 (2) ◽  
pp. 86-99 ◽  
Author(s):  
I. Gardner ◽  
M. Theves

Abstract During a cornering maneuver by a vehicle, high forces are exerted on the tire's footprint and in the contact zone between the tire and the rim. To optimize the design of these components, a method is presented whereby the forces at the tire-rim interface and between the tire and roadway may be predicted using finite element analysis. The cornering tire is modeled quasi-statically using a nonlinear geometric approach, with a lateral force and a slip angle applied to the spindle of the wheel to simulate the cornering loads. These values were obtained experimentally from a force and moment machine. This procedure avoids the need for a costly dynamic analysis. Good agreement was obtained with experimental results for self-aligning torque, giving confidence in the results obtained in the tire footprint and at the rim. The model allows prediction of the geometry and of the pressure distributions in the footprint, since friction and slip effects in this area were considered. The model lends itself to further refinement for improved accuracy and additional applications.


Author(s):  
Anna ILYENKO ◽  
Sergii ILYENKO ◽  
Yana MASUR

In this article, the main problems underlying the current asymmetric crypto algorithms for the formation and verification of electronic-digital signature are considered: problems of factorization of large integers and problems of discrete logarithm. It is noted that for the second problem, it is possible to use algebraic groups of points other than finite fields. The group of points of the elliptical curve, which satisfies all set requirements, looked attractive on this side. Aspects of the application of elliptic curves in cryptography and the possibilities offered by these algebraic groups in terms of computational efficiency and crypto-stability of algorithms were also considered. Information systems using elliptic curves, the keys have a shorter length than the algorithms above the finite fields. Theoretical directions of improvement of procedure of formation and verification of electronic-digital signature with the possibility of ensuring the integrity and confidentiality of information were considered. The proposed method is based on the Schnorr signature algorithm, which allows data to be recovered directly from the signature itself, similarly to RSA-like signature systems, and the amount of recoverable information is variable depending on the information message. As a result, the length of the signature itself, which is equal to the sum of the length of the end field over which the elliptic curve is determined, and the artificial excess redundancy provided to the hidden message was achieved.


1968 ◽  
Vol 87 (2) ◽  
pp. 279 ◽  
Author(s):  
M. S. Raghunathan
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document