English
Related papers

Related papers: Finite Representation Property for Relation Algebr…

200 papers

On every set A there is a rigid binary relation i.e. such a relation R \subseteq A \times A that there is no homomorphism (A,R) \rightarrow (A,R) except the identity (Vop{\v{e}}nka et al. [1965]). We prove that for each infinite cardinal…

Logic · Mathematics 2007-05-23 Apoloniusz Tyszka

For a fixed countably infinite structure \Gamma\ with finite relational signature \tau, we study the following computational problem: input are quantifier-free \tau-formulas \phi_0,\phi_1,...,\phi_n that define relations R_0,R_1,...,R_n…

Logic · Mathematics 2012-03-06 Manuel Bodirsky , Michael Pinsker , Todor Tsankov

For an algebraic number $\alpha$ we consider the orders of the reductions of $\alpha$ in finite fields. In the case where $\alpha$ is an integer, it is known by the work on Artin's primitive root conjecture that the order is "almost always…

Number Theory · Mathematics 2021-06-21 Olli Järviniemi

The notion of non-deterministic logical matrix (where connectives are interpreted as multi-functions) preserves many good properties of traditional semantics based on logical matrices (where connectives are interpreted as functions) whilst…

Logic in Computer Science · Computer Science 2022-04-15 Pedro Filipe , Carlos Caleiro , Sérgio Marcelino

Let $K$ be an algebraically closed field of arbitrary characteristic, $X$ an irreducible variety and $Y$ an irreducible projective variety over $K$, both are not necessarily smooth. Let $f:X\rightarrow X$ and $g:Y\rightarrow Y$ be dominant…

Algebraic Geometry · Mathematics 2017-12-08 Tuyen Trung Truong

Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper,…

Formal Languages and Automata Theory · Computer Science 2016-03-01 Emmanuel Filiot , Ismaël Jecker , Christof Löding , Sarah Winter

In this paper we first determine all irreducible representations of a wedge product of two table algebras in terms of the irreducible representations of two factors involved. Then we give some necessary and sufficient conditions for a table…

Representation Theory · Mathematics 2019-03-20 Javad Bagherian

Let $G$ be a complex connected reductive algebraic group and let $G_{\mathbb{R}}$ be a real form of $G$. We construct a sequence of functors $L_i\mathcal{R}$ from admissible (resp. finite-length) representations of $G$ to admissible (resp.…

Representation Theory · Mathematics 2022-04-25 Lucas Mason-Brown

Given a finitely-generated group $\pi$ and a linear algebraic group $G$, the representation variety Hom$(\pi,G)$ has a natural filtration by the characteristic varieties associated to a rational representation of $G$. Its algebraic…

Algebraic Topology · Mathematics 2016-11-17 Daniela Anca Macinic , Stefan Papadima , Clement Radu Popescu , Alexander I. Suciu

In this note, we give two different proofs that relation algebra $52_{65}$ is representable over a finite set. The first is probabilistic, and uses Johnson schemes. The second is an explicit group representation over $…

Logic · Mathematics 2017-12-04 Jeremy F. Alm , Roger D. Maddux

We calculate the real rank and stable rank of CCR algebras which either have only finite dimensional irreducible representations or have finite topological dimension. We show that either rank of A is determined in a good way by the ranks of…

Operator Algebras · Mathematics 2017-06-09 Lawrence G. Brown

We answer an implicit question of Ian Hodkinson's. We show that atomic Pinters algebras may not be completely representable, however the class of completely representable Pinters algebras is elementary and finitely axiomatizable. We obtain…

K-Theory and Homology · Mathematics 2013-04-03 Tarek Sayed Ahmed

Let $\mathfrak g$ be a reductive Lie algebra, and $m$ a positive integer. There is a natural density of irreducible representations of $\mathfrak g$, whose degrees are not divisible by $m$. For $\mathfrak g=\mathfrak{gl}_n$, this density…

Representation Theory · Mathematics 2023-12-04 Varun Shah , Steven Spallone

We show that, also within the class of representation-tame finite dimensional algebras $\Lambda$, the big left finitistic dimension of $\Lambda$ may be strictly larger than the little. In fact, the discrepancies $Findim \Lambda - findim…

Representation Theory · Mathematics 2019-12-20 Birge Huisgen-Zimmermann

We study property A for metric spaces $X$ with bounded geometry introduced by Guoliang Yu. Property A is an amenability-type condition, which is less restrictive than amenability for groups. The property has a connection with…

Operator Algebras · Mathematics 2020-04-15 Hiroki Sako

A complete classification and character formulas for finite-dimensional irreducible representations of the rational Cherednik algebra of type A is given. Less complete results for other types are obtained. Links to the geometry of affine…

Representation Theory · Mathematics 2007-05-23 Yuri Berest , Pavel Etingof , Victor Ginzburg

We study systems of polynomial equations in infinite finitely generated commutative associative rings with an identity element. For each such ring $R$ we obtain an interpretation by systems of equations of a ring of integers $O$ of a finite…

Number Theory · Mathematics 2021-02-08 Albert Garreta , Alexei Miasnikov , Denis Ovchinnikov

For representation by partial functions in the signature with intersection, composition and antidomain, we show that a representation is meet complete if and only if it is join complete. We show that a representation is complete if and only…

Rings and Algebras · Mathematics 2017-08-01 Brett McLean

The Chinese Remainder Theorem for the integers says that every system of congruence equations is solvable as long as the system satisfies an obvious necessary condition. This statement can be generalized in a natural way to arbitrary…

Computational Complexity · Computer Science 2023-07-07 Miguel Campercholi , Diego Castaño , Gonzalo Zigarán

A finite constraint language $\mathscr{R}$ is a finite set of relations over some finite domain $A$. We show that intractability of the constraint satisfaction problem $\operatorname{CSP}(\mathscr{R})$ can, in all known cases, be replaced…

Computational Complexity · Computer Science 2017-05-02 Lucy Ham , Marcel Jackson
‹ Prev 1 8 9 10 Next ›