English
Related papers

Related papers: Visibly Pushdown Languages and Free Profinite Alge…

200 papers

According to the basic idea of category theory, any Einstein algebra, essentially an algebraic formulation of general relativity, can be considered from the point of view of any object of the category of smooth algebras; such an object is…

Mathematical Physics · Physics 2022-10-26 Leszek Pysiak , Wiesław Sasin , Michael Heller , Tomasz Miller

In this paper, we propose a weak version of quotient for the algebraic action of a group on a variety, which we shall call a pseudo-quotient. They arise when we focus on the purely topological properties of good GIT quotients regardless of…

Algebraic Geometry · Mathematics 2023-11-03 Ángel González-Prieto

We introduce the notion of proper proximality for finite von Neumann algebras, which naturally extends the notion of proper proximality for groups. Apart from the group von Neumann algebras of properly proximal groups, we provide a number…

Operator Algebras · Mathematics 2022-11-18 Changying Ding , Srivatsav Kunnawalkam Elayavalli , Jesse Peterson

This paper discusses limitations of reflexive and diagonal arguments as methods of proof of limitative theorems (e.g. G\"odel's theorem on Entscheidungsproblem, Turing's halting problem or Chaitin-G\"odel's theorem). The fact, that a formal…

Logic in Computer Science · Computer Science 2015-03-19 Kajetan Młynarski

We investigate the power of graph isomorphism algorithms based on algebraic reasoning techniques like Gr\"obner basis computation. The idea of these algorithms is to encode two graphs into a system of equations that are satisfiable if and…

Computational Complexity · Computer Science 2015-02-23 Christoph Berkholz , Martin Grohe

Given only observational data $X = g(Z)$, where both the latent variables $Z$ and the generating process $g$ are unknown, recovering $Z$ is ill-posed without additional assumptions. Existing methods often assume linearity or rely on…

Machine Learning · Computer Science 2026-04-21 Yujia Zheng , Zijian Li , Shunxing Fan , Andrew Gordon Wilson , Kun Zhang

A process algebra is proposed, whose semantics maps a term to a nondeterministic finite automaton (NFA, for short). We prove a representability theorem: for each NFA $N$, there exists a process algebraic term $p$ such that its semantics is…

Formal Languages and Automata Theory · Computer Science 2024-02-02 Roberto Gorrieri

Let $R$ denote a 2-fir. The notions of F-independence and algebraic subsets of R are defined. The decomposition of an algebraic subset into similarity classes gives a simple way of translating the F-independence in terms of dimension of…

Rings and Algebras · Mathematics 2007-05-23 A. Leroy , A. Ozturk

Separation is a classical problem in mathematics and computer science. It asks whether, given two sets belonging to some class, it is possible to separate them by another set of a smaller class. We present and discuss the separation problem…

Formal Languages and Automata Theory · Computer Science 2013-03-12 Lorijn van Rooijen , Marc Zeitoun

In this paper, we use (bi)semicosimplicial language to study the classical problem of infinitesimal deformations of a closed subscheme in a fixed smooth variety, defined over an algebraically closed field of characteristic 0. In particular,…

Algebraic Geometry · Mathematics 2011-12-09 Donatella Iacono

Consider a finite-dimensional algebra $A$ and any of its moduli spaces $\mathcal{M}(A,\mathbf{d})^{ss}_{\theta}$ of representations. We prove a decomposition theorem which relates any irreducible component of…

Representation Theory · Mathematics 2018-09-25 Calin Chindris , Ryan Kinser

(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal…

Logic · Mathematics 2016-09-13 André Nies , Andrea Sorbi

Large Language Models (LLMs) perform internal computations in continuous vector spaces yet produce discrete tokens -- a fundamental mismatch whose geometric consequences remain poorly understood. We develop a mathematical framework that…

Machine Learning · Computer Science 2026-03-25 Mohamed A. Mabrok

Numerical characteristics of polynomial identities of left nilpotent algebras are examined. Previously, we came up with a construction which, given an infinite binary word, allowed us to build a two-step left nilpotent algebra with…

Rings and Algebras · Mathematics 2019-06-07 Mikhail V. Zaicev , Dušan D. Repovš

We present an algorithm which given a presentation of a group $G$ without 2-torsion, a solution to the word problem with respect to this presentation, and an acylindricity constant ${\kappa}$, outputs a collection of tracks in an…

Group Theory · Mathematics 2018-07-02 Nicholas W. M. Touikan

Let $f:V\times V\to F$ be a totally arbitrary bilinear form defined on a finite dimensional vector space $V$ over a a field $F$, and let $L(f)$ be the subalgebra of $\gl(V)$ of all skew-adjoint endomorphisms relative to $f$. Provided $F$ is…

Rings and Algebras · Mathematics 2013-08-22 S. Ruhallah Ahmadi , Martin Chaktoura , Fernando Szechtman

That announcement gives the structure of totally reducible linear Lie algebras which are the Lie algebra of the holonomy group of (at least) one torsion-free connection. The result uses the (already known) classi cation of the irreducible…

Differential Geometry · Mathematics 2013-04-10 Lionel Bérard Bergery

We define and study a new notion of "robust simulations" between complexity classes which is intermediate between the traditional notions of infinitely-often and almost-everywhere, as well as a corresponding notion of "significant…

Computational Complexity · Computer Science 2010-12-10 Lance Fortnow , Rahul Santhanam

In the first section we recall some basic notions on Lie algebras. In a second time we study the algebraic variety of complex $n$-dimensional Lie algebras. We present different notions of deformations : Gerstenhaber deformations,…

Rings and Algebras · Mathematics 2007-05-23 Michel Goze

In low dimensional topology, we have some invariants defined by using solutions of some nonlinear elliptic operators. The invariants could be understood as Euler class or degree in the ordinary cohomology, in infinite dimensional setting.…

Geometric Topology · Mathematics 2007-05-23 Mikio Furuta
‹ Prev 1 8 9 10 Next ›