Scientific

Non Classical Flag Domains and Spencer Resolutions

Speaker: 
Phillip Griffiths
Date: 
Wed, Jun 19, 2013
Location: 
PIMS, University of British Columbia
Conference: 
Recent advances in Hodge theory
Abstract: 

This talk has two parts. The common themes are the very interesting properties of flag domains and their quotients by discrete subgroups present only in the non-classical case. The first part will give a general overview of these properties, especially as they relate to several of the other talks being presented at this conference. The second part will focus on one particular property in the non-classical case. When suitably localized, the Harish-Chandra modules associated to discrete series -- especially the non-holomorphic and totally degenerate limits (TDLDS) of such -- may be canonically realized as the solution space to a holomorphic, linear PDE system. The invariants of the PDE system then relate to properties of the Harish-Chandra module: e.g., its tableau gives the K-type. Conversely, the representation theory, especially in the case of TDLDS, suggest interesting new issues in linear PDE theory.

Class: 

A characterization of p-automatic sequences as columns of linear cellular automata

Author: 
Reem Yassawi
Date: 
Mon, Jun 3, 2013 to Fri, Jun 7, 2013
Location: 
UBC
Conference: 
Automata Theory and Symbolic Dynamics
Abstract: 

I Given a symbolic dynamical system (X;T), does there exists
a cellular automaton with a subsystem conjugate to (X;T)?

Class: 
Subject: 

"Con uence" in Ito-Sadahiro number systems

Author: 
Tomá Vávra
Date: 
Mon, Jun 3, 2013 to Fri, Jun 7, 2013
Location: 
UBC
Conference: 
Automata Theory and Symbolic Dynamics
Abstract: 

Confluence" in Ito-Sadahiro number systems

Class: 
Subject: 

Hardness of Conjugacy, Embedding and Factorization in multidimensional SFTs

Author: 
Emmanuel Jeandel
Pascal Vanier
Date: 
Mon, Jun 3, 2013 to Fri, Jun 7, 2013
Location: 
UBC
Conference: 
Automata Theory and Symbolic Dynamics
Abstract: 

Hardness of Conjugacy, Embedding and Factorization in multidimensional SFTs

Notes: 
Class: 
Subject: 

Entropy minimality of Zd shifts of nite type

Author: 
Michael H. Schraudner
Date: 
Mon, Jun 3, 2013 to Fri, Jun 7, 2013
Location: 
UBC
Conference: 
Automata Theory and Symbolic Dynamics
Abstract: 

A some nite alphabet d 2 N the dimension
Zd full shift on A: AZd
: Zd AZd
! AZd
8~{;~| 2 Zd; x 2 AZd
: (~{; x)~| := x~{+~|
Zd (sub)shifts: X AZd
shift invariant, closed subset
given by a family of forbidden patterns F
S
F(Zd niteAF on nite shapes such that
XF :=

x 2 AZd 8~{ 2 Zd; F ( Zd nite : xj~{+F =2 F

Zd shifts of nite type (SFTs):
X is a Zd SFT :() 9F
S
F(Zd niteAF with jFj < 1 and X = XF (local rules)

Class: 
Subject: 

Symbolic covers of toral automorphisms

Author: 
Klaus Schmidt, Vienna
Date: 
Mon, Jun 3, 2013 to Fri, Jun 7, 2013
Location: 
UBC
Conference: 
Automata Theory and Symbolic Dynamics
Abstract: 

Symbolic covers of toral automorphisms

Class: 
Subject: 

Conjugacy and equivalence of weighted automata

Author: 
Jacques Sakarovitch
Date: 
Mon, Jun 3, 2013 to Fri, Jun 7, 2013
Location: 
UBC
Conference: 
Automata Theory and Symbolic Dynamics
Abstract: 

The results presented in this talk are based on a joint work with
Marie-Pierre B´eal (Univ. Paris-Est) and Sylvain Lombardy (Univ. Bordeaux)
published in Proc. of CSR 2006.
The complete journal version is still in preparation.
Some of the results have been included in the chapter
Rational and recognizable series
of the Handbook of Weighted Automata, Springer, 2009.

Class: 
Subject: 

Local Rules for Computable Planar Tilings

Author: 
T. Fernique
M. Sablik
Date: 
Mon, Jun 3, 2013 to Fri, Jun 7, 2013
Location: 
UBC
Conference: 
Automata Theory and Symbolic Dynamics
Abstract: 

Local Rules for Computable Planar Tilings

Class: 
Subject: 

Subshifts of linear complexity and subgroups of finite index of free groups

Author: 
Dominique Perrin
Date: 
Mon, Jun 3, 2013 to Fri, Jun 7, 2013
Location: 
UBC
Conference: 
Automata Theory and Symbolic Dynamics
Abstract: 

Develop automata theory inside a restricted set of words
(typically the factors of a shift)
Find classes of shifts for which some problems are simpler
(examples below).
Find natural generalizations of classes like Sturmian shifts
(like normal sets below).
Understand the role played by free groups in symbolic systems
(Sturmian or interval exchange shifts).

Class: 
Subject: 

Shifts of nite type with nearly full entropy

Author: 
Ronnie Pavlov
Date: 
Mon, Jun 3, 2013 to Fri, Jun 7, 2013
Location: 
UBC
Conference: 
Automata Theory and Symbolic Dynamics
Abstract: 

Shifts of nite type with nearly full entropy

Class: 
Subject: 

Pages