English
Related papers

Related papers: Complete representation by partial functions for c…

200 papers

Let X = S \oplus G, where S is a countable abelian semigroup and G is a countably infinite abelian group such that {2g : g in G} is infinite. Let pi: X \to G be the projection map defined by pi(s,g) = g for all x =(s,g) in X. Let f:X \to…

Number Theory · Mathematics 2016-12-30 Melvyn B. Nathanson

Choice functions constitute a simple, direct and very general mathematical framework for modelling choice under uncertainty. In particular, they are able to represent the set-valued choices that appear in imprecise-probabilistic decision…

Artificial Intelligence · Computer Science 2019-05-22 Jasper De Bock , Gert de Cooman

We define the completion of an associative algebra $A$ in a set $M=\{M_1,\dots,M_r\}$ of $r$ right $A$-modules in such a way that if $\mathfrak a\subseteq A$ is an ideal in a commutative ring $A$ the completion $A$ in the (right) module…

Algebraic Geometry · Mathematics 2024-10-23 Arvid Siqveland

Function graphs are graphs representable by intersections of continuous real-valued functions on the interval [0,1] and are known to be exactly the complements of comparability graphs. As such they are recognizable in polynomial time.…

Data Structures and Algorithms · Computer Science 2012-05-01 Pavel Klavík , Jan Kratochvíl , Tomasz Krawczyk , Bartosz Walczak

We demonstrate that topological defects in a rational conformal field theory can be described by a classifying algebra for defects - a finite-dimensional semisimple unital commutative associative algebra whose irreducible representations…

High Energy Physics - Theory · Physics 2010-11-23 Jurgen Fuchs , Christoph Schweigert , Carl Stigner

We study the first-order axiomatisability of finite semiring interpretations or, equivalently, the question whether elementary equivalence and isomorphism coincide for valuations of atomic facts over a finite universe into a commutative…

Logic · Mathematics 2021-02-11 Erich Grädel , Lovro Mrkonjić

Primarily this paper presents an expository report on alternatives to the traditional methods of classifying representations of finite dimensional algebras. Some new results illustrating such alternatives for algebras with only finitely…

Representation Theory · Mathematics 2014-07-10 Birge Huisgen-Zimmermann

In this paper, we give new proofs of the celebrated Andr\'eka-Resek-Thompson representability results of certain axiomatized cylindric-like algebras. Such representability results provide completeness theorems for variants of first order…

Logic · Mathematics 2018-11-07 Mohamed Khaled , Tarek Sayed Ahmed

It is shown that the lattices of flats of boolean representable simplicial complexes are always atomistic, but semimodular if and only if the complex is a matroid. A canonical construction is introduced for arbitrary finite atomistic…

Combinatorics · Mathematics 2015-10-20 Stuart Margolis , John Rhodes , Pedro V. Silva

We develop the representation theory of a finite semigroup over an arbitrary commutative semiring with unit, in particular classifying the irreducible and minimal representations. The results for an arbitrary semiring are as good as the…

Rings and Algebras · Mathematics 2010-04-13 Zur Izhakian , John Rhodes , Benjamin Steinberg

This paper concerns the long-standing question of representing (totally) anti-symmetric functions in high dimensions. We propose a new ansatz based on the composition of an odd function with a fixed set of anti-symmetric basis functions. We…

Classical Analysis and ODEs · Mathematics 2025-01-10 Ziang Chen , Jianfeng Lu

We prove that all definable pre-orders are atomic, in a finitely generated free algebra of a discriminator variety of finite similarity type which is generated by its finite members.

Logic · Mathematics 2016-06-27 H. Andréka , I. Németi

We introduce a framework for proving statements about linear operators by verification of ideal membership in a free algebra. More specifically, arbitrary first-order statements about identities of morphisms in preadditive semicategories…

Logic · Mathematics 2024-03-13 Clemens Hofstadler , Clemens G. Raab , Georg Regensburger

For a finite distributive lattice $D$, let us call $Q \subseteq D$ \emph{principal congruence representable}, if there is a finite lattice $L$ such that the congruence lattice of $L$ is isomorphic to $D$ and the principal congruences of $L$…

Rings and Algebras · Mathematics 2021-04-30 George Grätzer

We study the implications of model completeness of a theory for the effectiveness of presentations of models of that theory. It is immediate that for a computable model $\mathcal A$ of a computably enumerable, model complete theory, the…

Logic · Mathematics 2019-03-05 Jennifer Chubb , Russell Miller , Reed Solomon

A partially ordered set P is representable if there is a bounded distributive lattice such that its ordered set of prime ideals is order-isomorphic to P. We show that if the order components of a poset P are representable, then so is P.…

Logic · Mathematics 2007-05-30 Michael E. Adams , Dominic van der Zypen

We observe that for a large class of non-amenable groups $G$, one can find bounded representations of $A(G)$ on Hilbert space which are not completely bounded. We also consider restriction algebras obtained from $A(G)$, equipped with the…

Functional Analysis · Mathematics 2013-04-19 Yemon Choi , Ebrahim Samei

Let $\Fth$ be a $\Bk$-graph on a single vertex. We show that every irreducible atomic $*$-representation is the minimal $*$-dilation of a group construction representation. It follows that every atomic representation decomposes as a direct…

Operator Algebras · Mathematics 2008-04-25 Kenneth R. Davidson , Dilian Yang

Proofs of the fundamental theorem of algebra can be divided up into three groups according to the techniques involved: proofs that rely on real or complex analysis, algebraic proofs, and topological proofs. Algebraic proofs make use of the…

History and Overview · Mathematics 2015-04-23 Piotr Błaszczyk

An alternative proof of the completeness of relational algebra with respect to allowed formulas of first-order logic is presented. The proof relies on the well-known embedding of relational algebra into cylindric algebra, which makes it…

Logic in Computer Science · Computer Science 2026-03-17 Jan Laštovička