English
Related papers

Related papers: Structure theory of naturally reductive spaces

200 papers

We give an elementary construction of symplectic connections through reduction. This provides an elegant description of a class of symmetric spaces and gives examples of symplectic connections with Ricci type curvature, which are not…

Symplectic Geometry · Mathematics 2007-05-23 P. Baguis , M. Cahen

The constraints on the models for the structure formation arising from various cosmological observations at different length scales are reviewed. The status of different models for structure formation is examined critically in the light of…

Astrophysics · Physics 2007-05-23 T. Padmanabhan

The class of generic structures among those consisting of the measure algebra of a probability space equipped with an automorphism is axiomatizable by positive sentences interpreted using an approximate semantics. The separable generic…

Logic · Mathematics 2007-05-23 Alexander Berenstein , C. Ward Henson

We adapt the classical notion of learning from text to computable structure theory. Our main result is a model-theoretic characterization of the learnability from text for classes of structures. We show that a family of structures is…

The classical low-dimensional models of thin structures are based on certain a priori assumptions on the three-dimensional deformation and/or stress fields, diverse in nature but all motivated by the smallness of certain dimensions with…

Mathematical Physics · Physics 2013-05-15 Roberto Paroni , Paolo Podio-Guidugli

We study countable structures from the viewpoint of enumeration reducibility. Since enumeration reducibility is based on only positive information, in this setting it is natural to consider structures given by their positive atomic diagram…

Logic · Mathematics 2022-07-13 Barbara F. Csima , Luke MacLean , Dino Rossegger

To facilitate the design and optimization of nanomaterials for a given application it is necessary to understand the relationship between structure and physical properties. For large nanomaterials, there is imprecise structural information…

Mesoscale and Nanoscale Physics · Physics 2015-02-10 Vladan Mlinar

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

Discrete Mathematics · Computer Science 2017-08-08 Emmanuel Jeandel

We explore various combinatorial problems mostly borrowed from physics, that share the property of being continuously or discretely integrable, a feature that guarantees the existence of conservation laws that often make the problems…

Mathematical Physics · Physics 2017-11-22 Philippe Di Francesco

We provide a treatment of isomorphism within a set-theoretic formulation of dependent type theory. Type expressions are assigned their natural set-theoretic compositional meaning. Types are divided into small and large types --- sets and…

Logic in Computer Science · Computer Science 2018-01-23 David McAllester

Shapiro's notations for natural numbers, and the associated desideratum of acceptability - the property of a notation that all recursive functions are computable in it - is well-known in philosophy of computing. Computable structure theory,…

Logic · Mathematics 2022-05-03 Nikolay Bazhenov , Dariusz Kalociński

We consider the general problem of constructing the structure of a smooth manifold on a given space of loops in a smooth finite dimensional manifold. By generalising the standard construction for smooth loops, we derive a list of conditions…

Differential Geometry · Mathematics 2007-05-23 Andrew Stacey

We consider residue structures $R/G$ where $(G,+)$ is an additive subgroup of a ring $(R,+,\cdot)$, not necessarily an ideal. Special instances include Krasner's construction of quotient hyperfields, and Pumpluen's construction of…

Rings and Algebras · Mathematics 2024-03-19 Louis H. Rowen

Reversibility is a key issue in the interface between computation and physics, and of growing importance as miniaturization progresses towards its physical limits. Most foundational work on reversible computing to date has focussed on…

Logic in Computer Science · Computer Science 2011-12-01 Samson Abramsky

We develop the theory of locally small spaces in a new simple language and apply this simplification to re-build the theory of locally definable spaces over structures with topologies.

General Topology · Mathematics 2020-09-08 Artur Piękosz

This paper outlines a general formal framework for reasoning systems, intended to support future analysis of inference architectures across domains. We model reasoning systems as structured tuples comprising phenomena, explanation space,…

Artificial Intelligence · Computer Science 2025-08-05 Saleh Nikooroo , Thomas Engel

Transformer models contain substantial internal redundancy arising from coordinate-dependent representations and continuous symmetries, in model space and in head space, respectively. While recent approaches address this by explicitly…

Machine Learning · Computer Science 2026-02-24 J. François , L. Ravera

We consider definable topological spaces of dimension one in o-minimal structures, and state several equivalent conditions for when such a topological space $\left(X,\tau\right)$ is definably homeomorphic to an affine definable space…

Logic · Mathematics 2019-04-30 Ya'acov Peterzil , Ayala Rosel

In all structural models, the section or fiber response is a relation between the strain measures and the stress resultants. This relation can only be expressed in a simple analytical form when the material response is linear elastic. For…

Classical Physics · Physics 2020-03-18 David Portillo , Bastian Oesterle , Rebecca Thierer , Manfred Bischoff , Ignacio Romero

Continuous reducibilities are a proven tool in computable analysis, and have applications in other fields such as constructive mathematics or reverse mathematics. We study the order-theoretic properties of several variants of the two most…

Logic in Computer Science · Computer Science 2010-10-22 Arno Pauly