中文
相关论文

相关论文: Mathematical Structures Defined by Identities

200 篇论文

This thesis investigates the central role of homomorphism problems (structure-preserving maps) in two complementary domains: database querying over finite, graph-shaped data, and constraint solving over (potentially infinite) structures.…

计算机科学中的逻辑 · 计算机科学 2025-10-10 Rémi Morvan

We compare some algebras appeared in the recent attempts to prove resolution of singularities in positive characteristic. We also construct an algebra which encodes the same information and it is equivalent, up to integral closure, to the…

代数几何 · 数学 2012-08-10 Rocío Blanco , Santiago Encinas

The ordinary Structure Identity Principle states that any property of set-level structures (e.g., posets, groups, rings, fields) definable in Univalent Foundations is invariant under isomorphism: more specifically, identifications of…

We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a regular set of words, and the interpretation of the…

离散数学 · 计算机科学 2017-01-11 Bakhadyr Khoussainov , Andre Nies , Sasha Rubin , Frank Stephan

A logic is presented for reasoning on iterated sequences of formulae over some given base language. The considered sequences, or "schemata", are defined inductively, on some algebraic structure (for instance the natural numbers, the lists,…

计算机科学中的逻辑 · 计算机科学 2012-04-16 Mnacho Echenim , Nicolas Peltier

The notion of (symmetric) coloured operad or "multicategory" can be obtained from the notion of commutative algebra through a certain general process which we call "theorization" (where our term comes from an analogy with William Lawvere's…

范畴论 · 数学 2017-04-11 Takuo Matsuoka

Sharing of notations and theories across an inheritance hierarchy of mathematical structures, e.g., groups and rings, is important for productivity when formalizing mathematics in proof assistants. The packed classes methodology is a…

编程语言 · 计算机科学 2020-09-22 Kazuhiko Sakaguchi

We provide geometric methods and algorithms to verify, construct and enumerate pairs of words (of specified length over a fixed $m$-letter alphabet) that form identities in the semigroup $\ut{n}$ of $n\times n$ upper triangular tropical…

组合数学 · 数学 2018-08-14 Marianne Johnson , Ngoc Mai Tran

We study polynomial identities of algebras with adjoined external unit. For a wide class of algebras we prove that adjoining external unit element leads to increasing of PI-exponent precisely to 1. We also show that any real number from the…

环与代数 · 数学 2016-02-10 Dušan Repovš , Mikhail Zaicev

We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…

逻辑 · 数学 2026-01-21 Meng-Che "Turbo" Ho , Martin Ritter , Luca San Mauro

Coherence phenomena appear in two different situations. In the context of category theory the term `coherence constraints' refers to a set of diagrams whose commutativity implies the commutativity of a larger class of diagrams. In the…

q-alg · 数学 2007-05-23 Martin Markl , Steve Shnider

We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…

数值分析 · 数学 2025-08-14 Elias Jarlebring , Gustaf Lorentzon

We look at spaces of infinite-by-infinite matrices, and consider closed subsets that are stable under simultaneous row and column operations. We prove that up to symmetry, any of these closed subsets is defined by finitely many equations.

代数几何 · 数学 2016-02-26 Rob Eggermont

Ideals in the ring of power series in three variables can be classified based on algebra structures on their minimal free resolutions. The classification is incomplete in the sense that it remains open which algebra structures actually…

交换代数 · 数学 2024-09-26 Lars Winther Christensen , Orin Gotchey , Alexis Hardesty

We introduce fusion algebras with not necessarily positive structure constants and without identity element. We prove that they are semisimple when tensored with $\mathbb{C}$ and that their characters satisfy orthogonality relations. Then…

环与代数 · 数学 2007-05-23 Michael Cuntz

In this work, we consider a class of substitutions on infinite alphabets and show that they exhibit a growth behaviour which is impossible for substitutions on finite alphabets. While for both settings the leading term of the tile counting…

组合数学 · 数学 2023-03-14 Dirk Frettlöh , Alexey Garber , Neil Mañibo

We study canonical filtrations of finite-dimensional associative algebras and Lie algebras. These filtrations are defined via optimal destabilizing one-parameter subgroups in the sense of geometric invariant theory (GIT), and appear to be a…

代数几何 · 数学 2024-06-18 Trevor Jones

In this paper I consider locally finite Lie algebras of characteristic zero satisfying the condition that for every finite number of elements $x_{1}, x_{2},..., x_{k}$ of such an algebra $L$ there is finite-dimensional subalgebra $A$ which…

环与代数 · 数学 2007-05-23 L. A. Simonian

Utilizing spectral residues of parameterized, recursively defined sequences, we develop a general method for generating identities of composition sums. Specific results are obtained by focusing on coefficient sequences of solutions of first…

组合数学 · 数学 2007-05-23 Robert Milson

computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all abstract computable…

计算机科学中的逻辑 · 计算机科学 2007-05-23 J. V. Tucker , J. I. Zucker