English
Related papers

Related papers: Variations of rigidity

200 papers

We consider the relations between different measures of complexity for free homotopy classes of curves on a surface $\Sigma$, including the minimum number of self-intersections, the minimum length of the words representing them in a…

Geometric Topology · Mathematics 2018-07-20 Max Neumann-Coto , Macarena Covadonga Robles Arenas

We survey recent results concerning the complexity of regular languages represented by their minimal deterministic finite automata. In addition to the quotient complexity of the language -- which is the number of its (left) quotients, and…

Formal Languages and Automata Theory · Computer Science 2017-02-17 Janusz A. Brzozowski

The state complexity, respectively, nondeterministic state complexity of a regular language $L$ is the number of states of the minimal deterministic, respectively, of a minimal nondeterministic finite automaton for $L$. Some of the most…

Formal Languages and Automata Theory · Computer Science 2026-04-08 Arto Salomaa , Kai Salomaa , Taylor J. Smith

Let M be a compact manifold with boundary. In this paper, we discuss some rigidity theorems of metrics in a same conformal class that fixes the boundary and satisfy certain integral conditions on the the scalar curvatures and the mean…

Differential Geometry · Mathematics 2014-11-26 Ezequiel Barbosa , Heudson Mirandola , Feliciano Vitorio

We study deformations of complex projective varieties that are homotopically or homologically trivial. We formulate several conjectures and give some examples and partial answers.

Complex Variables · Mathematics 2012-01-16 Javier Fernandez de Bobadilla , János Kollár

We give a bound on the number of weighted real forms of a complex variety with finite automorphism group, where the weight is the inverse of the number of automorphisms of the real form. We give another bound involving the Sylow 2-subgroup…

Algebraic Geometry · Mathematics 2026-05-27 Gerard van der Geer , Xun Yu

Accounts of semantic phenomena often involve extending types of meanings and revising composition rules at the same time. The concept of monads allows many such accounts -- for intensionality, variable binding, quantification and focus --…

Computation and Language · Computer Science 2007-05-23 Chung-chieh Shan

Since its establishment, propositional dynamic logic (PDL) has been a subject of intensive academic research and frequent use in the industry. We have studied the complexity of some PDL problems and in this paper, we show results for some…

Logic in Computer Science · Computer Science 2024-01-23 Mohammad Javad Hosseinpour , Farzad Didehvar

The use of terms from natural and social scientific titles and abstracts is studied from the perspective of sublanguages and their specialized dictionaries. Different notions of sublanguage distinctiveness are explored. Objective methods…

cmp-lg · Computer Science 2008-02-03 Robert M. Losee , Stephanie W. Haas

This is a survey on rigidity and geometrization results obtained with the help of the discrete Hilbert-Einstein functional, written for the proceedings of the "Discrete Curvature" colloquium in Luminy.

Metric Geometry · Mathematics 2013-12-24 Ivan Izmestiev

Languages vary widely in how meanings map to word forms. These mappings have been found to support efficient communication; however, this theory does not account for systematic relations within word forms. We examine how a restricted set of…

Computation and Language · Computer Science 2026-01-27 Doreen Osmelak , Yang Xu , Michael Hahn , Kate McCurdy

This note aims at obtaining a variational characterization of complex structures by means of a calculus of variations for real vector bundle valued differential forms, and outlines a perspective to study existence questions via functionals…

Differential Geometry · Mathematics 2022-02-17 Gabriella Clemente

We explore a natural class of semigroups that have word problem decidable by finite state automata. Among the main results are invariance of this property under change of generators, invariance under basic algebraic constructions and…

Formal Languages and Automata Theory · Computer Science 2019-10-17 Max Neunhöffer , Markus Pfeiffer , Nik Ruskuc

Motivated by questions from program transformations, eight notions of isomorphisms between term rewriting systems are defined, analysed, and classified. The notions include global isomorphisms, where the renaming of variables and function…

Logic in Computer Science · Computer Science 2022-12-01 Michael Christian Fink Amores , David Sabel

UML activity diagrams have become an established notation to model control and data ow on various levels of abstraction, ranging from fine-grained descriptions of algorithms to high-level workflow models in business applications. A formal…

Software Engineering · Computer Science 2014-09-09 Hans Grönninger , Dirk Reiß , Bernhard Rumpe

We discuss some examples in which symplectic monodromy (provably or conjecturally) splits off the symplectic mapping class group, hoping to illustrate different techniques and inputs to the arguments. Along the way we formulate several open…

Symplectic Geometry · Mathematics 2026-01-29 Ailsa Keating , Ivan Smith , Michael Wemyss

An account of the transversality conditions of variational problems gives rise to essential results in the analysis of different physical phenomena. This powerful and elegant approach has proven to be fruitful in a diversity of variational…

In a previous paper, we described the set of words that appear in the coding of smooth (resp. analytic) curves at arbitrary small scale. The aim of this paper is to compute the complexity of those languages.

Discrete Mathematics · Computer Science 2011-08-19 Thierry Monteil

For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group,…

Dynamical Systems · Mathematics 2020-01-28 Yair Hartman , Bryna Kra , Scott Schmieding

Let $\mathbf{A}$ be a finite algebra generating a finitely decidable variety and having nontrivial strongly solvable radical $\tau$. We provide an improved bound on the number of variables in which a term can be sensitive to changes within…

Logic · Mathematics 2013-11-13 Matthew Smedberg