English
Related papers

Related papers: A Testing Algorithm of an Universal Algebra to be …

200 papers

This paper describes a large set of related theorem proving problems obtained by translating theorems from the HOL4 standard library into multiple logical formalisms. The formalisms are in higher-order logic (with and without type…

Logic in Computer Science · Computer Science 2019-11-20 Chad E. Brown , Thibault Gauthier , Cezary Kaliszyk , Geoff Sutcliffe , Josef Urban

Abstraction is key to human and artificial intelligence as it allows one to see common structure in otherwise distinct objects or situations and as such it is a key element for generality in AI. Anti-unification (or generalization) is…

Artificial Intelligence · Computer Science 2024-07-23 Christian Antić

A notion of an algebroid - a generalization of a Lie algebroid structure is introduced. We show that many objects of the differential calculus on a manifold M associated with the canonical Lie algebroid structure on T^M can be obtained in…

Differential Geometry · Mathematics 2009-10-31 Janusz Grabowski , Pawel Urbanski

In the paper we study the algebroid A of the groupoid of partially invertible elements over the lattice of orthogonal projections of a $W^*$-algebra. In particular the complex analytic manifold structure of these objects is investigated.…

Differential Geometry · Mathematics 2015-12-09 Anatol Odzijewicz , Grzegorz Jakimowicz , Aneta Sliżewska

We consider $\G$-graded commutative algebras, where $\G$ is an abelian group. Starting from a remarkable example of the classical algebra of quaternions and, more generally, an arbitrary Clifford algebra, we develop a general viewpoint on…

Mathematical Physics · Physics 2009-12-08 Sophie Morier-Genoud , Valentin Ovsienko

This paper explores the application of automated planning to automated theorem proving, which is a branch of automated reasoning concerned with the development of algorithms and computer programs to construct mathematical proofs. In…

Artificial Intelligence · Computer Science 2023-12-12 Alice Petrov , Christian Muise

This document provides a formal proof of Birkhoff's completeness theorem for multi-sorted algebras which states that any equational entailment valid in all models is also provable in the equational theory. More precisely, if a certain…

Logic in Computer Science · Computer Science 2021-11-16 Andreas Abel

In this paper, we give a refinement of a generalized Dedekind's theorem. In addition, we show that all possible values of integer group determinants of any group are also possible values of integer group determinants of its any abelian…

Representation Theory · Mathematics 2023-06-28 Naoya Yamaguchi , Yuka Yamaguchi

We construct a graded Lie algebra in which a solution to the vacuum Einstein equations is any element of degree 1 whose bracket with itself is zero. Each solution generates a cochain complex, whose first cohomology is linearized gravity…

General Relativity and Quantum Cosmology · Physics 2014-12-18 Michael Reiterer , Eugene Trubowitz

Let K be a field of positive characteristic p, let R be either a group algebra K[G] or a restricted enveloping algebra u(L), and let I be the augmentation ideal of R. We first characterize those R for which I satisfies a polynomial identity…

Representation Theory · Mathematics 2012-02-17 David M. Riley , Mark C. Wilson

This article reviews a class of adaptive group testing procedures that operate under a probabilistic model assumption as follows. Consider a set of $N$ items, where item $i$ has the probability $p$ ($p_i$ in the generalized group testing)…

Methodology · Statistics 2021-02-19 Yaakov Malinovsky , Paul S. Albert

This is a brief review of our recent work attempted at a generalization of the Grassmann algebra to the paragrassmann ones. The main aim is constructing an algebraic basis for representing `fractional' symmetries appearing in $2D$…

High Energy Physics - Theory · Physics 2007-05-23 A. T. Filippov , A. B. Kurdikov

The partition algebra is an associative algebra with a basis of set-partition diagrams and multiplication given by diagram concatenation. It contains as subalgebras a large class of diagram algebras including the Brauer, planar partition,…

Representation Theory · Mathematics 2019-06-27 Tom Halverson , Theodore N. Jacobson

For any given finite abelian group, we give factorizations of the group determinant in the group algebra of any subgroup. The factorizations are an extension of Dedekind's theorem. The extension leads to a generalization of Dedekind's…

Representation Theory · Mathematics 2023-03-03 Naoya Yamaguchi

We propose an algebraic study of the simple graph isomorphism problem. We define a Hopf algebra from an explicit realization of its elements as formal power series. We show that these series can be evaluated on graphs and count occurrences…

Combinatorics · Mathematics 2015-11-19 Nicolas Borie

We use the technology of linking groupoids to show that equivalent groupoids have Morita equivalent reduced C*-algebras. This equivalence is compatible in a natural way in with the Equivalence Theorem for full groupoid C*-algebras.

Operator Algebras · Mathematics 2010-07-14 Aidan Sims , Dana P. Williams

Eberhard-type theorems are statements about the realizability of a polytope (or more general polyhedral maps) given the valency of its vertices and sizes of its polygonal faces up to a linear linear degree of freedom. We present new…

Combinatorics · Mathematics 2019-01-04 Sebastian Manecke

We establish conditions under which the universal and reduced norms coincide for a Fell bundle over a groupoid. Specifically, we prove that the full and reduced C*-algebras of any Fell bundle over a measurewise amenable groupoid coincide,…

Operator Algebras · Mathematics 2012-01-05 Aidan Sims , Dana P. Williams

The main objective of this work is to study mathematical properties of computational paths. Originally proposed by de Queiroz \& Gabbay (1994) as `sequences of rewrites', computational paths can be seen as the grounds on which the…

Logic in Computer Science · Computer Science 2015-09-23 Arthur F. Ramos , Ruy J. G. B. de Queiroz , Anjolina de Oliveira

Term algebras are important objects in computer science and are correspondingly well-studied. A natural generalization is to quotient these algebras by finitely many ground term equations, obtaining what we call almost free algebras. One of…

Logic · Mathematics 2026-04-28 Yifan Jia , Heer Tern Koh , Bakh Khoussainov