English
Related papers

Related papers: Notes on the ordered set $A^A$. Part III. Exponent…

200 papers

The elements of a finite partial order $P$ can be identified with the maximal indecomposable two-sided ideals of its incidence algebra $\A$, and then for two such ideals, $I\prec J \iff IJ \not=0$. This offers one way to recover a poset…

Combinatorics · Mathematics 2009-11-10 Rafael D. Sorkin

We prove an algebraic extension theorem for the computably enumerable sets, $\mathcal{E}$. Using this extension theorem and other work we then show if $A$ and $\hat{A}$ are automorphic via $\Psi$ then they are automorphic via $\Lambda$…

Logic · Mathematics 2007-05-23 Peter Cholak , Leo Harrington

We prove that a large family of graphs which are decomposable with respect to the modular decomposition can be reconstructed from their collection of vertex-deleted subgraphs.

Combinatorics · Mathematics 2012-02-28 Robert Brignall , Nicholas Georgiou , Robert J. Waters

For a real number $x$ and set of natural numbers $A$, define $x \ast A := \{ x a \bmod 1: a\in A\}\subseteq [0,1).$ We consider relationships between $x$, $A$, and the order-type of $x\ast A$. For example, for every irrational $x$ and…

Number Theory · Mathematics 2020-04-23 D. Dakota Blair , Joel David Hamkins , Kevin O'Bryant

This paper exploits adjacencies between the orbits of an ordered set P and a consequence of the classification of finite simple groups to, in many cases, exponentially bound the number of automorphisms. Results clearly identify the…

Combinatorics · Mathematics 2023-09-12 Bernd S. W. Schröder

In this article we define a new reducibility based on the enumeration orders of r.e. sets.

Formal Languages and Automata Theory · Computer Science 2010-03-03 Ali Akbar Safilian , Farzad Didehvar

A poset ${\mathbb{P}}$ is called reversible iff every bijective homomorphism $f:{\mathbb{P}} \rightarrow {\mathbb{P}}$ is an automorphism. Let ${\mathcal{W}}$ and ${\mathcal{W}} ^*$ denote the classes of well orders and their inverses…

Logic · Mathematics 2017-11-21 Miloš S. Kurilić , Nenad Morača

Let A be an augmented algebra over a semi-simple algebra S. We show that the Ext algebra of S as an A-module, enriched with its natural A-infinity structure, can be used to reconstruct the completion of A at the augmentation ideal. We use…

Algebraic Geometry · Mathematics 2008-07-11 Ed Segal

We prove some basic results about irreducible components of varieties of modules for an arbitrary finitely generated associative algebra. Our work generalizes results of Kac and Schofield on representations of quivers, but our methods are…

Algebraic Geometry · Mathematics 2007-05-23 William Crawley-Boevey , Jan Schröer

We consider the dimensions of finite type of representations of a partially ordered set, i.e. such that there is only finitely many isomorphism classes of representations of this dimension. We give a criterion for a dimension to be of…

Representation Theory · Mathematics 2012-01-24 Yuriy A. Drozd , Eugene A. Kubichka

The higher order matching problem is the problem of determining whether a term is an instance of another in the simply typed $\lambda$-calculus, i.e. to solve the equation a = b where a and b are simply typed $\lambda$-terms and b is…

Logic in Computer Science · Computer Science 2023-06-05 Gilles Dowek

A relational structure is called reversible iff every bijective endomorphism of that structure is an automorphism. We give several equivalents of that property in the class of disconnected binary structures and some its subclasses. For…

Logic · Mathematics 2017-11-07 Miloš S. Kurilić , Nenad Morača

We classify the finite irreducible modules over the conformal superalgebra $K'_{4}$ by their correspondence with finite conformal modules over the associated annihilation superalgebra $\mathcal A(K'_{4})$. This is achieved by a complete…

Representation Theory · Mathematics 2022-09-14 Lucia Bagnoli , Fabrizio Caselli

We generalize the notion of saturated order to infinite partial orders and give both a set-theoretic and an algebraic characterization of such orders. We then study the proof theoretic strength of the equivalence of these characterizations…

Logic · Mathematics 2010-10-13 Damir D. Dzhafarov

In this paper we consider first-order logic theorem proving and model building via approximation and instantiation. Given a clause set we propose its approximation into a simplified clause set where satisfiability is decidable. The…

Logic in Computer Science · Computer Science 2015-05-22 Andreas Teucke , Christoph Weidenbach

Many theorems of mathematics have the form that for a certain problem, e.g. a differential equation or polynomial (in)equality, there exists a solution. The sequential version then states that for a sequence of problems, there is a sequence…

Logic · Mathematics 2024-03-21 Dag Normann , Sam Sanders

Let $A$ be an $n$-dimensional algebra over a field $k$ and $a(A)$ its quantum symmetry semigroup. We prove that the automorphisms group ${\rm Aut}_{\rm Alg} (A)$ of $A$ is isomorphic to the group $U \bigl( G(a (A)^{\rm o} ) \bigl)$ of all…

Rings and Algebras · Mathematics 2022-03-28 G. Militaru

The strong isomorphism classes of extensions of finite groups are parametrized by orbits of a prescribed action on the second cohomology group. We study these orbits in the case of extensions of a finite abelian $p$-group by a cyclic factor…

Group Theory · Mathematics 2023-09-25 Oihana Garaialde Ocaña , Mima Stanojkovski

Let $d \geq 3$ be a natural number. We show that for all finite, non-empty sets $A \subseteq \mathbb{R}^d$ that are not contained in a translate of a hyperplane, we have \[ |A-A| \geq (2d-2)|A| - O_d(|A|^{1- \delta}),\] where $\delta >0$ is…

Combinatorics · Mathematics 2023-06-22 Akshat Mudgal

We propose a simple approach to formal deformations of associative algebras. It exploits the machinery of multiplicative coresolutions of an associative algebra A in the category of A-bimodules. Specifically, we show that certain…

Mathematical Physics · Physics 2018-08-15 Alexey A. Sharapov , Evgeny D. Skvortsov