English
Related papers

Related papers: Minimal signatures with undecidability of represen…

200 papers

Altenbernd, Thomas and W\"ohrle have considered in [ATW02] acceptance of languages of infinite two-dimensional words (infinite pictures) by finite tiling systems, with the usual acceptance conditions, such as the B\"uchi and Muller ones,…

Logic · Mathematics 2011-08-03 Olivier Finkel

We will consider the indefinite truncated multidimensional moment problem. Necessary and sufficient conditions for a given truncated multisequence to have a signed representing measure $\mu$ with ${\rm card}\,{\rm supp}\, \mu$ as small as…

Functional Analysis · Mathematics 2020-06-17 David P. Kimsey

This article investigates structural connections between unrefinable partitions into distinct parts and numerical semigroups. By analysing the hooksets of Young diagrams associated with numerical sets, new criteria for recognising…

Combinatorics · Mathematics 2026-01-16 Lorenzo Campioni

We consider countable so-called rich subsemigroups of (\omega\omega,\circ); each such semigroup $T$ gives a variety CPEA_T that is axiomatizable by a finite schema of equations taken in a countable subsignature of that of \omega-dimensional…

Logic · Mathematics 2015-03-03 Tarek Sayed Ahmed

We study finite first-order satisfiability (FSAT) in the constructive setting of dependent type theory. Employing synthetic accounts of enumerability and decidability, we give a full classification of FSAT depending on the first-order…

Logic in Computer Science · Computer Science 2020-04-17 Dominik Kirst , Dominique Larchey-Wendling

We consider bipartite graphs definable in o-minimal structures, in which the edge relation $G$ is a finite union of graphs of certain measure-preserving maps. We establish a fact on the existence of definable matchings with few short…

Logic · Mathematics 2023-05-10 Jana Maříková

In 1978, Munn proved that a bounded complex representation of an inverse semigroup is semiunitary and completely reducible. We consider the converse question in the finite case. We provide some sufficient conditions from a finite regular…

Representation Theory · Mathematics 2021-01-22 Chun-Hui Wang

Uncertainty relations lie at the very core of quantum mechanics, and form the cornerstone of essentially all quantum cryptographic applications. In particular, they play an important role in cryptographic protocols in the…

Quantum Physics · Physics 2008-08-27 Stephanie Wehner , Andreas Winter

For a compact group $\mathbb{G}$, the functor from unital Banach algebras with contractive morphisms to metric spaces with 1-Lipschitz maps sending a Banach algebra $A$ to the space of $\mathbb{G}$-representations in $A$ preserves filtered…

Functional Analysis · Mathematics 2023-11-23 Alexandru Chirvasitu

In this paper, we show that the presence of the Archimedean and the mixture-continuity properties of a binary relation, both empirically non-falsifiable in principle, foreclose the possibility of consistency (transitivity) without…

Theoretical Economics · Economics 2019-05-07 Tsogbadral Galaabaatar , M. Ali Khan , Metin Uyanık

Undecidability of various properties of first order term rewriting systems is well-known. An undecidable property can be classified by the complexity of the formula defining it. This gives rise to a hierarchy of distinct levels of…

Logic in Computer Science · Computer Science 2009-03-02 Joerg Endrullis , Herman Geuvers , Hans Zantema

In this series of papers, we investigate properties of a finite group which are determined by its low degree irreducible representations over a number field $F$, i.e. its representations on matrix rings $\operatorname{M}_n(D)$ with $n \leq…

Representation Theory · Mathematics 2026-02-13 Robynn Corveleyn , Geoffrey Janssens , Doryan Temmerman

We study a notion of indecomposability in differential algebraic groups which is inspired by both model theory and differential algebra. After establishing some basic definitions and results, we prove an indecomposability theorem for…

Logic · Mathematics 2014-10-24 James Freitag

The theory of two binary relations has the strong amalgamation property when the first relation is assumed to be coarser than the second relation, and each relation satisfies a chosen set of properties from the following list: transitivity,…

Logic · Mathematics 2023-01-31 Paolo Lipparini

We deploy algebraic complexity theoretic techniques for constructing symmetric determinantal representations of for00504925mulas and weakly skew circuits. Our representations produce matrices of much smaller dimensions than those given in…

Computational Complexity · Computer Science 2012-10-24 Bruno Grenet , Erich Kaltofen , Pascal Koiran , Natacha Portier

In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…

Discrete Mathematics · Computer Science 2023-09-21 Ruiwen Dong

Session types are used to describe communication protocols in distributed systems and, as usual in type theories, session subtyping characterizes substitutability of the communicating processes. We investigate the (un)decidability of…

Programming Languages · Computer Science 2017-07-20 Mario Bravetti , Marco Carbone , Gianluigi Zavattaro

We develop a unified representation theory for the categories of finite subsets and relation-preserving maps of highly homogeneous relational structures classified by Cameron. For any commutative coefficient ring $k$, we extend the…

Representation Theory · Mathematics 2026-04-28 Liping Li

We define antidomain operations for algebras of multiplace partial functions. For all signatures containing composition, the antidomain operations and any subset of intersection, preferential union and fixset, we give finite equational or…

Rings and Algebras · Mathematics 2017-09-19 Brett McLean

A semigroup conjugacy is an equivalence relation that equals group conjugacy when the semigroup is a group. In this note, we answer five open problems related to semigroup conjugacy. (Problem One) We say a conjugacy ~ is partition-covering…

Group Theory · Mathematics 2024-11-26 Trevor Jack
‹ Prev 1 4 5 6 7 8 10 Next ›