ChemInform Abstract: Enantioselective Rhodium(I) Donor Carbenoid-Mediated Cascade Triggered by a Base-Free Decomposition of Arylsulfonyl Hydrazones.

ChemInform ◽  
2016 ◽  
Vol 47 (11) ◽  
pp. no-no
Author(s):  
Oscar Torres ◽  
Teodor Parella ◽  
Miquel Sola ◽  
Anna Roglans ◽  
Anna Pla-Quintana
Keyword(s):  
Free Decomposition

Enantioselective Rhodium(I) Donor Carbenoid-Mediated Cascade Triggered by a Base-Free Decomposition of Arylsulfonyl Hydrazones

2015 ◽  
Vol 21 (45) ◽  
pp. 16240-16245 ◽  
Author(s):  
Òscar Torres ◽  
Teodor Parella ◽  
Miquel Solà ◽  
Anna Roglans ◽  
Anna Pla-Quintana
Keyword(s):  
Free Decomposition

scholarly journals Explicit Pieri Inclusions

10.37236/9216 ◽  
2021 ◽  
Vol 28 (3) ◽  
Author(s):  
Markus Hunziker ◽  
John A. Miller ◽  
Mark Sepanski
Keyword(s):  
Time Complexity ◽  
General Linear Group ◽  
Free Resolutions ◽  
Exponential Time ◽  
Exterior Power ◽  
Bounded Number ◽  
Finite Dimensional ◽  
Dimensional Irreducible Representation ◽  
Multiplicity Free ◽  
Free Decomposition

By the Pieri rule, the tensor product of an exterior power and a finite-dimensional irreducible representation of a general linear group has a multiplicity-free decomposition. The embeddings of the constituents  are called Pieri inclusions and were first studied by Weyman in his thesis and described explicitly by Olver. More recently, these maps have appeared in the work of Eisenbud, Fløystad, and Weyman and of Sam and Weyman to compute pure free resolutions for classical groups. In this paper, we give a new closed form, non-recursive description of Pieri inclusions. For partitions with a bounded number of distinct parts, the resulting algorithm has polynomial time complexity whereas the previously known algorithm has exponential time complexity.

INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES

2006 ◽  
Vol 17 (02) ◽  
pp. 379-393 ◽  
Author(s):  
YO-SUB HAN ◽  
YAJUN WANG ◽  
DERICK WOOD
Keyword(s):  
Polynomial Time ◽  
Regular Language ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Regular Languages ◽  
Finite State Automaton ◽  
Primality Test ◽  
Finite State ◽  
State Pair ◽  
Free Decomposition

We study infix-free regular languages. We observe the structural properties of finite-state automata for infix-free languages and develop a polynomial-time algorithm to determine infix-freeness of a regular language using state-pair graphs. We consider two cases: 1) A language is specified by a nondeterministic finite-state automaton and 2) a language is specified by a regular expression. Furthermore, we examine the prime infix-free decomposition of infix-free regular languages and design an algorithm for the infix-free primality test of an infix-free regular language. Moreover, we show that we can compute the prime infix-free decomposition in polynomial time. We also demonstrate that the prime infix-free decomposition is not unique.

New Algorithms for Polynomial Square-Free Decomposition over the Integers

1979 ◽  
Vol 8 (3) ◽  
pp. 300-305 ◽  
Author(s):  
Paul S. Wang ◽  
Barry M. Trager
Keyword(s):  
New Algorithms ◽  
Free Decomposition
Sign in / Sign up

Export Citation Format

Share Document