scholarly journals Polynomial invariant generation for non-deterministic recursive programs

Author(s):  
Krishnendu Chatterjee ◽  
Hongfei Fu ◽  
Amir Kafshdar Goharshady ◽  
Ehsan Kafshdar Goharshady
1991 ◽  
Vol 14 (2) ◽  
pp. 261-281
Author(s):  
Fred Kröger ◽  
Stephan Merz

We propose a temporal logic based on structures divided into several layers of linear “time scales” and give a sound and complete derivation system. The logic is applied to the formulation and verification of assertions about sequential recursive programs.


2013 ◽  
Vol 24 (01) ◽  
pp. 1250126 ◽  
Author(s):  
SEUNG-MOON HONG

We consider two approaches to isotopy invariants of oriented links: one from ribbon categories and the other from generalized Yang–Baxter (gYB) operators with appropriate enhancements. The gYB-operators we consider are obtained from so-called gYBE objects following a procedure of Kitaev and Wang. We show that the enhancement of these gYB-operators is canonically related to the twist structure in ribbon categories from which the operators are produced. If a gYB-operator is obtained from a ribbon category, it is reasonable to expect that two approaches would result in the same invariant. We prove that indeed the two link invariants are the same after normalizations. As examples, we study a new family of gYB-operators which is obtained from the ribbon fusion categories SO (N)2, where N is an odd integer. These operators are given by 8 × 8 matrices with the parameter N and the link invariants are specializations of the two-variable Kauffman polynomial invariant F.


2001 ◽  
Vol 83 (3) ◽  
pp. 513-531 ◽  
Author(s):  
Béla Bollobás ◽  
Oliver Riordan

2019 ◽  
Vol 383 (8) ◽  
pp. 707-717 ◽  
Author(s):  
M.A. Jafarizadeh ◽  
M. Yahyavi ◽  
N. Karimi ◽  
A. Heshmati

2007 ◽  
Vol 176 (3) ◽  
pp. 21-35
Author(s):  
Yi Fang ◽  
Lenore D. Zuck
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document