Related papers: Stable theories and representation over sets
The purpose of this paper is to study stable representations of partially ordered sets (posets) and compare it to the well known theory for quivers. In particular, we prove that every indecomposable representation of a poset of finite type…
We determine which faithful irreducible representations $V$ of a simple linear algebraic group $G$ are generically free for Lie($G$), i.e., which $V$ have an open subset consisting of vectors whose stabilizer in Lie($G$) is zero. This…
We prove a strong non-structure theorem for a class of metric structures with an unstable pair of formulae. As a consequence, we show that weak categoricity (that is, categoricity up to isomorphisms and not isometries) implies several…
Several advances have extended the power and versatility of coherent state theory to the extent that it has become a vital tool in the representation theory of Lie groups and their Lie algebras. Representative applications are reviewed and…
Stable homotopy theory is governed by the principle that after inverting loop spaces, homotopy types become the representing objects for homology theories. We show that this principle extends to higher category theory: inverting…
We characterize stable T for which the model completion of T_{aut} is stable (i.e., every completion is). Then we prove that ``some completion is stable'' is different and we characterize it. Finally we show that if T is stable, T_{aut} has…
Let $X$ be a non-singular irreducible complex projective curve of genus $g\geq 2$. We use $(t,\ell)$-stability to prove the existence of coherent systems over $X$ that are $\alpha$-stable for all allowed $\alpha >0$.
The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…
We describe an inductive machinery to prove various properties of representations of a category equipped with a generic shift functor. Specifically, we show that if a property (P) of representations of the category behaves well under the…
We describe those unipotent representations of a finite group of Lie type which are defined over the rational numbers.
It is a well known empirical observation that natural axiomatic theories are pre-well-ordered by consistency strength. For any natural theory $T$, the next strongest natural theory is $T+\mathsf{Con}_T$. We formulate and prove a statement…
Let M be an o-minimal structure with elimination of imaginaries, N an unstable structure definable in M. Then there exists X, interpretable in N, such that X with all the structure induced from N is o-minimal. In particular X is linearly…
In this article we investigate the notion and basic properties of Boolean algebras and prove the Stone's representation theorem. The relations of Boolean algebras to logic and to set theory will be studied and, in particular, a neat proof…
We prove that there are energetically stable bimetric theories. These theories satisfies a positive energy theorem. We construct a model example.
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…
It is shown how regular model sets can be characterized in terms of regularity properties of their associated dynamical systems. The proof proceeds in two steps. First, we characterize regular model sets in terms of a certain map $\beta$…
Covering theory is an important tool in representation theory of algebras, however, the results and the proofs are scattered in the literature. We give an introduction to covering theory at a level as elementary as possible.
Theory of representations of universal algebra is a natural development of the theory of universal algebra. Morphism of the representation is the map that conserve the structure of the representation. Exploring of morphisms of the…
A serial property is a suitably enumerated sequence $\{F_n\}$ of formulas and is called selector provable in PA if there is a PA-recursive function $s(x)$ such that PA $\vdash \forall x (s(x){:}_{\text{PA}} \ulcorner F_x\urcorner)$ where…
In this article, we prove a representation theorem that any generic line arrangement in the plane over an ordered field which has global cyclicity can be represented isomorphically by a line arrangement with a given set of distinct slopes…