English
Related papers

Related papers: The Holonomy Decomposition of Circular Semi-Flower…

200 papers

We develop a holonomy reduction procedure for general Cartan geometries. We show that, given a reduction of holonomy, the underlying manifold naturally decomposes into a disjoint union of initial submanifolds. Each such submanifold…

Differential Geometry · Mathematics 2014-05-08 Andreas Cap , A. Rod Gover , Matthias Hammerl

The reduction of nonholonomic systems is formulated in terms of Dirac reduction. An optimal reduction method for a class of nonholonomic systems is formulated. Several examples are studied in detail.

Differential Geometry · Mathematics 2011-10-17 Madeleine Jotz , Tudor Ratiu

This paper concerns the structural stability of smooth cylindrical symmetric transonic flows in a concentric cylinder under helically symmetric perturbation of suitable boundary conditions. The deformation-curl decomposition developed by…

Analysis of PDEs · Mathematics 2024-03-20 Yi Ke , Shangkun Weng

The dynamical behavior of non-uniform cellular automata is compared with the one of classical cellular automata. Several differences and similarities are pointed out by a series of examples. Decidability of basic properties like…

Formal Languages and Automata Theory · Computer Science 2011-07-27 Alberto Dennunzio , Enrico Formenti , Julien Provillard

Profinite semigroups are a generalization of finite semigroups that come about naturally when one is interested in considering free structures with respect to classes of finite semigroups. They also appear naturally through dualization of…

Group Theory · Mathematics 2018-04-24 Jorge Almeida , Alfredo Costa

In this paper, we exhibit a strong relation between the sand automata configuration space and the cellular automata configuration space. This relation induces a compact topology for sand automata, and a new context in which sand automata…

Computational Complexity · Computer Science 2008-12-18 Alberto Dennunzio , Pierre Guillon , Benoît Masson

In this paper, we address the problem of identifying linear structural equation models. We first extend the edge set half-trek criterion to cover a broader class of models. We then show that any semi-Markovian linear model can be…

Artificial Intelligence · Computer Science 2015-08-11 Bryant Chen

Nonlocal operators that have appeared in a variety of physical models satisfy identities and enjoy a range of properties similar to their classical counterparts. In this paper we obtain Helmholtz-Hodge type decompositions for two-point…

Analysis of PDEs · Mathematics 2019-08-26 M. D'Elia , C. Flores , X. Li , P. Radu , Y. Yu

Forest automata (FA) have recently been proposed as a tool for shape analysis of complex heap structures. FA encode sets of tree decompositions of heap graphs in the form of tuples of tree automata. In order to allow for representing…

Logic in Computer Science · Computer Science 2013-04-23 Lukas Holik , Ondrej Lengal , Adam Rogalewicz , Jiri Simacek , Tomas Vojnar

Cellular automata are a set of computational models in discrete space that have a discrete time evolution defined by neighbourhood rules. They are used to simulate many complex systems in physics and science in general. In this work,…

Cellular Automata and Lattice Gases · Physics 2023-05-12 Luca Bertolani , Andrea Idini

A geometric derivation of nonholonomic integrators is developed. It is based in the classical technique of generating functions adapted to the special features of nonholonomic systems. The theoretical methodology and the integrators…

Mathematical Physics · Physics 2016-09-07 M. de Leon , D. Martin de Diego , A. Santamaria Merino

In this paper, we study conditions which ensure the existence of backward flow invariant domains for semigroups of holomorphic self-mappings of a simply connected domain $D$. More precisely, the problem is the following. Given a…

Complex Variables · Mathematics 2007-05-23 Mark Elin , David Shoikhet , Lawrence Zalcman

We present a theory of automata with boundary for designing, modelling and analysing distributed systems. Notions of behaviour, design and simulation appropriate to the theory are defined. The problem of model checking for deadlock…

Distributed, Parallel, and Cluster Computing · Computer Science 2007-05-23 R. Gates , P. Katis , N. Sabadini , R. F. C. Walters

The most developed aspect of the theory of finite semigroups is their classification in pseudovarieties. The main motivation for investigating such entities comes from their connection with the classification of regular languages via…

Group Theory · Mathematics 2025-04-14 Jorge Almeida

Based on the recent progress in the irregular Riemann-Hilbert correspondence for holonomic D-modules, we show that the characteristic cycles of some standard irregular holonomic D-modules can be expressed as in the classical theorem of…

Algebraic Geometry · Mathematics 2026-03-13 Kazuki Kudomi , Kiyoshi Takeuchi

A bialgebra is a structure which is simultaneously an algebra and a coalgebra, such that the algebraic and coalgebraic parts are "compatible". Bialgebras are normally studied over a field or commutative ring. In this paper, we show how to…

Rings and Algebras · Mathematics 2009-10-30 James Worthington

In the classical theory of formal languages, finite state automata allow to recognize the words of a rational subset of $\Sigma^*$ where $\Sigma$ is a set of symbols (or the alphabet). Now, given a semiring $(\K,+,.)$, one can construct…

Combinatorics · Mathematics 2016-08-16 Gérard Duchamp , Eric Laugerotte , Jean-Gabriel Luque

We study the geometry and holonomy of semi-Riemannian, time-like metric cones that are indecomposable, i.e., which do not admit a local decomposition into a semi-Riemannian product. This includes irreducible cones, for which the holonomy…

Differential Geometry · Mathematics 2022-04-14 Dmitri Alekseevsky , Vicente Cortés , Thomas Leistner

The integral expressions served to decompose vector field into irrotational and divergence-free components represent modern version of the Helmholtz decomposition theorem. These expressions are also widely used to decompose the…

General Physics · Physics 2023-04-19 Vladimir Onoochin

Looking at the automata defined over a group alphabet as a nearring, we see that they are a highly complicated structure. As with ring theory, one method to deal with complexity is to look at semisimplicity modulo radical structures. We…

Formal Languages and Automata Theory · Computer Science 2014-12-05 Tim Boykett , Gerhard Wendt