On Generalized Sklyanin Algebras

2000 ◽  
Vol 7 (4) ◽  
pp. 689-700 ◽  
Author(s):  
G. Khimshiashvili ◽  
R. Przybysz
Keyword(s):  
Algebraic Method ◽  
Finite Graph ◽  
Poisson Structures ◽  
Euler Characteristics ◽  
Open Problems ◽  
Sklyanin Algebras ◽  
Sklyanin Algebra

Abstract A class of algebraic Poisson structures on R 4 is introduced which contains the well-known Sklyanin algebras. For this class, an effective algebraic method of computing Euler characteristics of Casimir levels is developed which enables us to compute them in the case of Sklyanin algebras. It is also shown that one may associate a finite graph with every generalized Sklyanin algebra. Some related results and open problems are also presented.

scholarly journals Degenerate Sklyanin algebras

Open Physics ◽  
2010 ◽  
Vol 8 (4) ◽  
Author(s):  
Andrey Smirnov
Keyword(s):  
Difference Operators ◽  
Baxter Equation ◽  
Quantum Algebras ◽  
Rational Solutions ◽  
R Matrix ◽  
Gauge Transformations ◽  
Sklyanin Algebras ◽  
Sklyanin Algebra ◽  
The Difference

AbstractNew trigonometric and rational solutions of the quantum Yang-Baxter equation (QYBE) are obtained by applying some singular gauge transformations to the known Belavin-Drinfeld elliptic R-matrix for sl(2;?). These solutions are shown to be related to the standard ones by the quasi-Hopf twist. We demonstrate that the quantum algebras arising from these new R-matrices can be obtained as special limits of the Sklyanin algebra. A representation for these algebras by the difference operators is found. The sl(N;?)-case is discussed.

Combinatorics with Definable Sets: Euler Characteristics and Grothendieck Rings

2000 ◽  
Vol 6 (3) ◽  
pp. 311-330 ◽  
Author(s):  
Jan Krajíček ◽  
Thomas Scanlon
Keyword(s):  
Euler Characteristic ◽  
Order Structure ◽  
Euler Characteristics ◽  
Grothendieck Ring ◽  
Open Problems ◽  
Partially Ordered ◽  
Counting Functions ◽  
Finite Structures ◽  
Definable Sets ◽  
Grothendieck Rings

AbstractWe recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially ordered Euler characteristic and Grothendieck ring and give a characterization of structures that have non-trivial partially ordered Grothendieck ring. We give a generalization of counting functions to locally finite structures, and use the construction to show that the Grothendieck ring of the complex numbers contains as a subring the ring of integer polynomials in continuum many variables. We prove the existence of a universal strong Euler characteristic on a structure. We investigate the dependence of the Grothendieck ring on the theory of the structure and give a few counter-examples. Finally, we relate some open problems and independence results in bounded arithmetic to properties of particular Grothendieck rings.

scholarly journals Quotients of degenerate Sklyanin algebras

2017 ◽  
Vol 16 (05) ◽  
pp. 1750085 ◽  
Author(s):  
Kevin De Laet
Keyword(s):  
Heisenberg Group ◽  
Hilbert Series ◽  
Three Dimensional ◽  
Central Element ◽  
Sklyanin Algebras ◽  
Sklyanin Algebra

In this paper, it is shown how the Heisenberg group of order 27 can be used to construct quotients of degenerate Sklyanin algebras. These quotients have properties similar to the classical Sklyanin case in the sense that they have the same Hilbert series, the same character series and a central element of degree 3. Regarding the central element of a three-dimensional Sklyanin algebra, a better way to view this using Heisenberg-invariants is shown.

An algebraic method for solving Hartree-Fock-Roothaan equations

1990 ◽  
Vol 87 ◽  
pp. 2017-2025 ◽  
Author(s):  
Lac Malbouisson ◽  
JDM Vianna
Keyword(s):  
Algebraic Method ◽  
Hartree Fock

Topics in Quaternion Linear Algebra

2014 ◽  
Author(s):  
Leiba Rodman
Keyword(s):  
Linear Algebra ◽  
Complex Analysis ◽  
Dimensional Space ◽  
Applied Mathematics ◽  
Three Dimensional ◽  
Number System ◽  
Graduate Course ◽  
Open Problems ◽  
Unpublished Research ◽  
Reference Tool

Quaternions are a number system that has become increasingly useful for representing the rotations of objects in three-dimensional space and has important applications in theoretical and applied mathematics, physics, computer science, and engineering. This is the first book to provide a systematic, accessible, and self-contained exposition of quaternion linear algebra. It features previously unpublished research results with complete proofs and many open problems at various levels, as well as more than 200 exercises to facilitate use by students and instructors. Applications presented in the book include numerical ranges, invariant semidefinite subspaces, differential equations with symmetries, and matrix equations. Designed for researchers and students across a variety of disciplines, the book can be read by anyone with a background in linear algebra, rudimentary complex analysis, and some multivariable calculus. Instructors will find it useful as a complementary text for undergraduate linear algebra courses or as a basis for a graduate course in linear algebra. The open problems can serve as research projects for undergraduates, topics for graduate students, or problems to be tackled by professional research mathematicians. The book is also an invaluable reference tool for researchers in fields where techniques based on quaternion analysis are used.

Continuous Glucose Monitoring Time Series and Hypo/Hyperglycemia Prevention: Requirements, Methods, Open Problems

2008 ◽  
Vol 4 (3) ◽  
pp. 181-192 ◽  
Author(s):  
Giovanni Sparacino ◽  
Andrea Facchinetti ◽  
Alberto Maran ◽  
Claudio Cobelli
Keyword(s):  
Time Series ◽  
Continuous Glucose Monitoring ◽  
Glucose Monitoring ◽  
Open Problems ◽  
Monitoring Time

Secure Cloud Quantum Computing with Verification Based on Quantum Interactive Proof

Impact ◽  
2019 ◽  
Vol 2019 (10) ◽  
pp. 30-32
Author(s):  
Tomoyuki Morimae
Keyword(s):  
Quantum Computing ◽  
Quantum Information ◽  
Theoretical Physics ◽  
View Point ◽  
Research Subjects ◽  
Interactive Proof ◽  
Open Problems ◽  
Main Research ◽  
Proof Systems ◽  
Information Group

In cloud quantum computing, a classical client delegate quantum computing to a remote quantum server. An important property of cloud quantum computing is the verifiability: the client can check the integrity of the server. Whether such a classical verification of quantum computing is possible or not is one of the most important open problems in quantum computing. We tackle this problem from the view point of quantum interactive proof systems. Dr Tomoyuki Morimae is part of the Quantum Information Group at the Yukawa Institute for Theoretical Physics at Kyoto University, Japan. He leads a team which is concerned with two main research subjects: quantum supremacy and the verification of quantum computing.

Classification of Cloud Systems Cyber-security Threats and Solutions Directives

2017 ◽  
Vol 2 (3) ◽  
pp. 1
Author(s):  
Hanane Bennasar ◽  
Mohammad Essaaidi ◽  
Ahmed Bendahmane ◽  
Jalel Benothmane
Keyword(s):  
Cloud Computing ◽  
Cyber Security ◽  
Data Security ◽  
Denial Of Service ◽  
Security Threats ◽  
Huge Number ◽  
Open Problems ◽  
Long Period ◽  
Near Future

Cloud computing cyber security is a subject that has been in top flight for a long period and even in near future. However, cloud computing permit to stock up a huge number of data in the cloud stockage, and allow the user to pay per utilization from anywhere via any terminal equipment. Among the major issues related to Cloud Computing security, we can mention data security, denial of service attacks, confidentiality, availability, and data integrity. This paper is dedicated to a taxonomic classification study of cloud computing cyber-security. With the main objective to identify the main challenges and issues in this field, the different approaches and solutions proposed to address them and the open problems that need to be addressed.

Sign in / Sign up

Export Citation Format

Share Document