English
Related papers

Related papers: Weihrauch goes Brouwerian

200 papers

Let $\Lambda$ be a finite-dimensional associative algebra over a field. A semibrick pair is a finite set of $\Lambda$-modules for which certain Hom- and Ext-sets vanish. A semibrick pair is completable if it can be enlarged so that a…

Representation Theory · Mathematics 2023-05-25 Emily Barnard , Eric J. Hanson

In this paper, we introduce a class of infinite matrices related to the Beurling algebra of periodic functions, and we show that it is an inverse-closed subalgebra of ${\mathcal B}(\ell^q_w)$, the algebra of all bounded linear operators on…

Functional Analysis · Mathematics 2010-08-26 Qiyu Sun

We study Kazdan-Warner equations on a connected finite graph via the method of the degree theory. Firstly, we prove that all solutions to the Kazdan-Warner equation with nonzero prescribed function are uniformly bounded and the Brouwer…

Differential Geometry · Mathematics 2021-04-21 Linlin Sun , Liuquan Wang

We provide a self-contained introduction into Weihrauch complexity and its applications to computable analysis. This includes a survey on some classification results and a discussion of the relation to other approaches.

Logic · Mathematics 2021-09-28 Vasco Brattka , Guido Gherardi , Arno Pauly

Based on the reduction of degree in polynomial mappings and some known results in algebraic geometry, by introducing the Brouwer degree, a tool from differential topology, algebraic topology and algebraic geometry, we completely prove the…

Algebraic Geometry · Mathematics 2022-09-07 Quan Xu

In this paper we present a systematic study of $W$ algebras from the Hamiltonian reduction point of view. The Drinfeld-Sokolov (DS) reduction scheme is generalized to arbitrary $sl_2$ embeddings thus showing that a large class of W algebras…

High Energy Physics - Theory · Physics 2007-05-23 T. Tjin

We investigate the uniform computational content of the open and clopen Ramsey theorems in the Weihrauch lattice. While they are known to be equivalent to $\mathrm{ATR_0}$ from the point of view of reverse mathematics, there is not a…

Logic · Mathematics 2023-06-22 Alberto Marcone , Manlio Valenti

This paper compares different representations (in the sense of computable analysis) of a number of function spaces that are of interest in analysis. In particular subspace representations inherited from a larger function space are compared…

Logic in Computer Science · Computer Science 2016-12-09 Arno Pauly , Florian Steinberg

In this paper we derive some basic results of circuit theory using `Implicit Linear Algebra' (ILA). This approach has the advantage of simplicity and generality. Implicit linear algebra is outlined in [1]. We denote the space of all vectors…

Systems and Control · Electrical Eng. & Systems 2020-05-05 H. Narayanan , Hariharan Narayanan

We give a simpler proof of a result of Hodkinson in the context of a blow and blur up construction argueing that the idea at heart is similar to that adopted by Andr\'eka et all \cite{sayed}. The idea is to blow up a finite structure,…

Logic · Mathematics 2013-05-21 Tarek Sayed Ahmed

This paper investigates the homology of the Brauer algebras, interpreted as appropriate Tor-groups, and shows that it is closely related to the homology of the symmetric group. Our main results show that when the defining parameter of the…

Algebraic Topology · Mathematics 2023-06-13 Rachael Boyd , Richard Hepworth , Peter Patzt

Matthias Schr\"oder has asked the question whether there is a weakest discontinuous problem in the continuous version of the Weihrauch lattice. Such a problem can be considered as the weakest unsolvable problem. We introduce the…

Logic · Mathematics 2025-10-14 Vasco Brattka

We introduce a Brauer type algebra $B_G (\Upsilon) $ associated with every pseudo reflection group and every Coxeter group $G$. When $G$ is a Coxeter group of simply-laced type we show $B_G (\Upsilon)$ is isomorphic to the generalized…

Representation Theory · Mathematics 2011-02-23 Zhi Chen

For a quantale $\V$, first a closure-theoretic approach to completeness and separation in $\V$-categories is presented. This approach is then generalized to $\Tth$-categories, where $\Tth$ is a topological theory that entails a set monad…

Category Theory · Mathematics 2008-01-03 Dirk Hofmann , Walter Tholen

In this note we give an axiomatization of Boolean algebras based on weakly dicomplemented lattices: an algebra $(L,\wedge,\vee,\tu)$ of type $(2,2,1)$ is a Boolean algebra iff $(L,\wedge,\vee)$ is a non empty lattice and $(x\wedge…

Logic · Mathematics 2009-07-08 Leonard Kwuida

A double algebra is a linear space $V$ equipped with linear map $V\otimes V\to V\otimes V$. Additional conditions on this map lead to the notions of Lie and associative double algebras. We prove that simple finite-dimensional Lie double…

Quantum Algebra · Mathematics 2018-10-31 M. E. Goncharov , P. S. Kolesnikov

After an introduction to some aspects of bidifferential calculus on associative algebras, we focus on the notion of a "symmetry" of a generalized zero curvature equation and derive Backlund and (forward, backward and binary) Darboux…

Exactly Solvable and Integrable Systems · Physics 2020-02-19 Aristophanes Dimakis , Folkert Müller-Hoissen

Lattice theoretical generalizations of some classical linear algebra results are formulated. A vector space is replaced by its subspace lattice and a linear map is replaced by the induced lattice map. This map is a complete join…

Rings and Algebras · Mathematics 2007-05-23 Jeno Szigeti

To every minimal model of a complete local isolated cDV singularity Donovan--Wemyss associate a finite dimensional symmetric algebra known as the contraction algebra. We construct the first known standard derived equivalences between these…

Representation Theory · Mathematics 2020-02-11 Jenny August

In a capacitated directed graph, it is known that the set of all min-cuts forms a distributive lattice [1], [2]. Here, we describe this lattice as a regular predicate whose forbidden elements can be advanced in constant parallel time after…

Data Structures and Algorithms · Computer Science 2025-12-23 Robert Streit , Vijay K. Garg