Current developments in the synthesis of 4-chromanone-derived compounds

2021 ◽  
Author(s):  
Elizabeth J Diana ◽  
U. S. Kanchana ◽  
Thomas V. Mathew
Keyword(s):  
Large Class ◽  
Building Block ◽  
Medicinal Compounds ◽  
Structural Entity

The chroman-4-one framework is a significant structural entity that belongs to the class of oxygen-containing heterocycles. It acts as a major building block in a large class of medicinal compounds,...

scholarly journals Chemo-Enzymatic Synthesis of a Multi-Useful Chiral Building Block Molecule for the Synthesis of Medicinal Compounds

Molecules ◽  
2011 ◽  
Vol 16 (8) ◽  
pp. 6747-6757 ◽  
Author(s):  
Toshiki Nakano ◽  
Yusuke Yagi ◽  
Mizuki Miyahara ◽  
Akio Kaminura ◽  
Motoi Kawatsura ◽  
...  
Keyword(s):  
Building Block ◽  
Enzymatic Synthesis ◽  
Medicinal Compounds ◽  
Chiral Building Block

scholarly journals The Grassmannian VOA

2020 ◽  
Vol 2020 (9) ◽  
Author(s):  
Lorenz Eberhardt ◽  
Tomáš Procházka
Keyword(s):  
Large Class ◽  
Vertex Operator ◽  
Building Block ◽  
Operator Algebras ◽  
Parametric Family ◽  
Vertex Operator Algebras ◽  
Basic Building Block ◽  
Lagrangian Grassmannian ◽  
Complete Set ◽  
Simple Character

Abstract We study the 3-parametric family of vertex operator algebras based on the Grassmannian coset CFT $$ \mathfrak{u} $$ u (M + N )k /($$ \mathfrak{u} $$ u (M )k×$$ \mathfrak{u} $$ u (N )k ). This VOA serves as a basic building block for a large class of cosets and generalizes the $$ {\mathcal{W}}_{\infty } $$ W ∞ algebra. We analyze representations and their characters in detail and find surprisingly simple character formulas for the representations in the generic parameter regime that admit an elegant combinatorial formulation. We also discuss truncations of the algebra and give a conjectural formula for the complete set of truncation curves. We develop a theory of gluing for these algebras in order to build more complicated coset and non-coset algebras. We demonstrate the power of this technology with some examples and show in particular that the $$ \mathcal{N} $$ N = 2 supersymmetric Grassmannian can be obtained by gluing three bosonic Grassmannian algebras in a loop. We finally speculate about the tantalizing possibility that this algebra is a specialization of an even larger 4-parametric family of algebras exhibiting pentality symmetry. Specializations of this conjectural family should include both the unitary Grassmannian family as well as the Lagrangian Grassmannian family of VOAs which interpolates between the unitary and the orthosymplectic cosets.

A Large Class of p-Ary Cyclic Codes and Sequence Families

2010 ◽  
Vol E93-A (11) ◽  
pp. 2272-2277
Author(s):  
Zhengchun ZHOU ◽  
Xiaohu TANG ◽  
Udaya PARAMPALLI
Keyword(s):  
Large Class ◽  
Cyclic Codes

The Social Furniture of Virtual Worlds

Disputatio ◽  
2019 ◽  
Vol 11 (55) ◽  
pp. 345-369
Author(s):  
Peter Ludlow
Keyword(s):  
Large Class ◽  
Data Structures ◽  
Virtual Worlds ◽  
Causal Powers ◽  
Virtual Objects ◽  
David Chalmers ◽  
The Social

AbstractDavid Chalmers argues that virtual objects exist in the form of data structures that have causal powers. I argue that there is a large class of virtual objects that are social objects and that do not depend upon data structures for their existence. I also argue that data structures are themselves fundamentally social objects. Thus, virtual objects are fundamentally social objects.

Computing Cores for Existential Rules with the Standard Chase and ASP

2020 ◽  
Author(s):  
Markus Krötzsch
Keyword(s):  
Large Class ◽  
Data Exchange ◽  
Answer Set Programming ◽  
Query Answering ◽  
Universal Model ◽  
The Core ◽  
Universal Models ◽  
General Terms ◽  
Special Cases ◽  
The Many

To reason with existential rules (a.k.a. tuple-generating dependencies), one often computes universal models. Among the many such models of different structure and cardinality, the core is arguably the “best”. Especially for finitely satisfiable theories, where the core is the unique smallest universal model, it has advantages in query answering, non-monotonic reasoning, and data exchange. Unfortunately, computing cores is difficult and not supported by most reasoners. We therefore propose ways of computing cores using practically implemented methods from rule reasoning and answer set programming. Our focus is on cases where the standard chase algorithm produces a core. We characterise this desirable situation in general terms that apply to a large class of cores, derive concrete approaches for decidable special cases, and generalise these approaches to non-monotonic extensions of existential rules.

Sign in / Sign up

Export Citation Format

Share Document