English
Related papers

Related papers: Tameness and frames revisited

200 papers

The survey is devoted to the combinatorial and metric theory of filtrations, i.\,e., decreasing sequences of $\sigma$-algebras in measure spaces or decreasing sequences of subalgebras of certain algebras. One of the key notions, that of…

Dynamical Systems · Mathematics 2017-08-02 Anatoly Vershik

A new notion of independence relation is given and associated to it, the class of flat theories, a subclass of strong stable theories including the superstable ones is introduced. More precisely, after introducing this independence…

Logic · Mathematics 2018-04-18 Daniel Palacín , Saharon Shelah

Diagrammatic notation has become a ubiquitous computational tool; early examples include Penrose's graphical notation for tensor calculus, Feynman's diagrams for perturbative quantum field theory, and Cvitanovic's birdtracks for Lie…

Algebraic Topology · Mathematics 2022-08-30 Christoph Dorn , Christopher L. Douglas

For $K$ an abstract elementary class with amalgamation and no maximal models, we show that categoricity in a high-enough cardinal implies structural properties such as the uniqueness of limit models and the existence of good frames. This…

Logic · Mathematics 2016-02-18 Monica M. VanDieren , Sebastien Vasey

This work presents the tessellations and polytopes from the perspective of both n-dimensional geometry and abstract symmetry groups. It starts with a brief introduction to the terminology and a short motivation. In the first part, it…

Group Theory · Mathematics 2023-01-06 Plamen Dimitrov

The recently introduced and characterized scalable frames can be considered as those frames which allow for perfect preconditioning in the sense that the frame vectors can be rescaled to yield a tight frame. In this paper we define…

Numerical Analysis · Mathematics 2014-02-04 Gitta Kutyniok , Kasso A. Okoudjou , Friedrich Philipp

We study the $2$-categories BIon, of (generalized) bounded ionads, and $\text{Acc}_\omega$, of accessible categories with directed colimits, as an abstract framework to approach formal model theory. We relate them to topoi and (lex)…

Category Theory · Mathematics 2025-08-05 Ivan Di Liberti

We give a combinatorial characterization of generic minimally rigid reflection frameworks. The main new idea is to study a pair of direction networks on the same graph such that one admits faithful realizations and the other has only…

Geometric Topology · Mathematics 2012-03-13 Justin Malestein , Louis Theran

We produce a long exact sequence whose terms are unit groups of associative algebras that behave as inner automorphisms of a given tensor. Our sequence generalizes known sequences for associative and non-associative algebras. In a manner…

Rings and Algebras · Mathematics 2020-11-23 Peter A. Brooksbank , Joshua Maglione , James B. Wilson

We study the coherence and conservativity of extensions of dependent type theories by additional strict equalities. By considering notions of congruences and quotients of models of type theory, we reconstruct Hofmann's proof of the…

Logic in Computer Science · Computer Science 2020-10-28 Rafaël Bocquet

We exhibit an equivalence between the model-theoretic framework of universal classes and the category-theoretic framework of locally multipresentable categories. We similarly give an equivalence between abstract elementary classes (AECs)…

Logic · Mathematics 2019-01-25 Michael Lieberman , Jiří Rosický , Sebastien Vasey

We study the conditions under which N=(1,1) generalized sigma models support an extension to N=(2,2). The enhanced supersymmetry is related to the target space complex geometry. Concentrating on a simple situation, related to Poisson sigma…

High Energy Physics - Theory · Physics 2009-11-11 Andreas Bredthauer , Ulf Lindstrom , Jonas Persson

The present paper is the first one in the sequence of papers about a simple class of {\em framed $4$-graphs}; the goal of the present paper is to collect some well-known results on planarity and to reformulate them in the language of {\em…

Combinatorics · Mathematics 2014-02-10 Vassily Olegovich Manturov

We generalize the notion of tame discrete sets introduced by Rosay and Rudin from complex-Euclidean space to arbitrary complex manifolds and establish their basic properties. We show that complex-linear algebraic groups different from the…

Complex Variables · Mathematics 2018-11-27 Rafael B. Andrist , Riccardo Ugolini

We prove that posets of bounded height whose cover graphs belong to a fixed class with bounded expansion have bounded dimension. Bounded expansion, introduced by Ne\v{s}et\v{r}il and Ossona de Mendez as a model for sparsity in graphs, is a…

Combinatorics · Mathematics 2019-02-11 Gwenaël Joret , Piotr Micek , Veit Wiechert

We introduce the homogeneous and piecewise multilinear extensions and the eigenvalue problem for locally Lipschitz function pairs, in order to develop a systematic framework for relating discrete and continuous min-max problems. This also…

Combinatorics · Mathematics 2021-11-25 Jürgen Jost , Dong Zhang

The paper is devoted to frame expansions in Fr\'echet spaces. First we review some results which concern series expansions in general Fr\'echet spaces via Fr\'echet and General Fr\'echet frames. Then we present some new results on series…

Functional Analysis · Mathematics 2020-09-11 Stevan Pilipović , Diana T. Stoeva

One approach to ease the construction of frames is to first construct local components and then build a global frame from these. In this paper we will show that the study of the relation between a frame and its local components leads to the…

Functional Analysis · Mathematics 2007-05-23 Peter G. Casazza , Gitta Kutyniok

This work presents a quantitative framework for describing the overcompleteness of a large class of frames. It introduces notions of localization and approximation between two frames $\mathcal{F} = \{f_i\}_{i \in I}$ and $\mathcal{E} =…

Functional Analysis · Mathematics 2007-05-23 R. Balan , P. G. Casazza , C. Heil , Z. Landau

We show how an image can, in principle, be described by the tangles of the graph of its pixels. The tangle-tree theorem provides a nested set of separations that efficiently distinguish all the distinguishable tangles in a graph. This…

Combinatorics · Mathematics 2017-11-09 Reinhard Diestel , Geoff Whittle