English
Related papers

Related papers: Weihrauch goes Brouwerian

200 papers

In this work, two algorithms are developed related to lattice codes. In the first one, an extended complete Gr\"obner basis is computed for the label code of a lattice. This basis supports all term orderings associated with a total degree…

Information Theory · Computer Science 2023-02-22 I. Álvarez-Barrientos , M. Borges-Quintana , M. A. Borges Trenard , E. Martínez Moro , J. A. Ornella

Let k be an algebraically closed field of characteristic p>0. We compute the Weyl filtration multiplicities in indecomposable tilting modules and the decomposition numbers for the general linear group over k in terms of cap diagrams under…

Representation Theory · Mathematics 2023-01-09 Rudolf Tange

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

We introduce the notion of reflexivity for combinatory algebras. Reflexivity can be thought of as an equational counterpart of the Meyer-Scott axiom of combinatory models, which indeed allows us to characterise an equationally definable…

Logic in Computer Science · Computer Science 2022-07-01 Marlou M. Gijzen , Hajime Ishihara , Tatsuji Kawai

For W a finite (2-)reflection group and B its (generalized) braid group, we determine the Zariski closure of the image of B inside the corresponding Iwahori-Hecke algebra. The Lie algebra of this closure is reductive and generated in the…

Representation Theory · Mathematics 2009-11-11 Ivan Marin

Brauer tree algebras are important and fundamental blocks in the modular representation theory of groups. In this research, we present a combination of two main approaches to the tilting theory of Brauer tree algebras. The first approach is…

Representation Theory · Mathematics 2016-08-16 Mary Schaps , Zehavit Zvi

In this paper, we introduce the concept of a (lattice) skew Hilbert algebra as a natural generalization of Hilbert algebras. This notion allows a unified treatment of several structures of prominent importance for mathematical logic, e.g.…

Logic · Mathematics 2021-05-19 Ivan Chajda , Kadir Emir , Davide Fazio , Helmut Länger , Antonio Ledda , Jan Paseka

We study a fine hierarchy of Borel-piecewise continuous functions, especially, between closed-piecewise continuity and $G_\delta$-piecewise continuity. Our aim is to understand how a priority argument in computability theory is connected to…

Logic · Mathematics 2019-03-14 Takayuki Kihara

We define a class of algebras, the semilattices of Mal'cev blocks (for short, SMB algebras). In a nutshell, these algebras are semilattices in which each element gets blown up into a Mal'cev algebra. We publish for the first time our old…

Computational Complexity · Computer Science 2026-04-08 Petar Marković , Miklós Maróti , Ralph McKenzie , Aleksandar Prokić

We expand FLew with a unary connective whose algebraic counterpart is the operation that gives the greatest complemented element below a given argument. We prove that the expanded logic is conservative and has the Finite Model Property. We…

Logic · Mathematics 2016-12-07 Rodolfo C. Ertola-Biraben , Francesc Esteva , Lluís Godo

This paper provides a conceptual study of the twisting procedure, which amounts to create functorially new differential graded Lie algebras, associative algebras or operads (as well as their homotopy versions) from a Maurer--Cartan element.…

Quantum Algebra · Mathematics 2019-03-05 Vladimir Dotsenko , Sergey Shadrin , Bruno Vallette

FL$_\mathrm{ew}$-algebras form the algebraic semantics of the full Lambek calculus with exchange and weakening. We investigate two relations, called satisfiability and positive satisfiability, between FL$_\mathrm{ew}$-terms and…

Logic in Computer Science · Computer Science 2016-08-01 Zuzana Haniková , Petr Savický

In this work, we construct the deformed Butcher-Connes-Kreimer Hopf algebra coming from the theory of Regularity Structures as the universal envelope of a post-Lie algebra. We show that this can be done using either of the two combinatorial…

Probability · Mathematics 2023-07-06 Yvain Bruned , Foivos Katsetsiadis

The Brauer algebra has a basis of diagrams and these generate a monoid $H$ consisting of scalar multiples of diagrams. Following a recent paper by Kudryavtseva and Mazorchuk, we define and completely determine three types of conjugation in…

Representation Theory · Mathematics 2009-11-30 Armin Shalile

We formulate a conjecture classifying algebraic solutions to (possibly non-linear) algebraic differential equations, in terms of the primes appearing in the denominators of the coefficients of their Taylor expansion at a non-singular point.…

Algebraic Geometry · Mathematics 2025-01-24 Yeuk Hay Joshua Lam , Daniel Litt

Transformation coefficients between standard bases for irreducible representations of the Brauer centralizer algebra $\mathfrak{B}_f(x)$ and split bases adapted to the $\mathfrak{B}_{f_1} (x) \times \mathfrak{B}_{f_2} (x) \subset…

Mathematical Physics · Physics 2008-11-26 Vincenzo Chilla

In this paper, we tell a story about incompleteness in modal logic. The story weaves together a paper of van Benthem, `Syntactic aspects of modal incompleteness theorems,' and a longstanding open question: whether every normal modal logic…

Logic in Computer Science · Computer Science 2019-09-04 Wesley H. Holliday , Tadeusz Litak

Using the technique of inductive resolution introduced in arXiv:2303.07979, we prove that the homology of Rook-Brauer Algebra, interpreted as appropriate Tor-group, is isomorphic to that of symmetric group for all degrees under the…

Rings and Algebras · Mathematics 2025-05-29 Khoa Ta

We construct a normal form for the walled Brauer algebra, together with the reduction algorithm. We apply normal form to calculate the numbers of monomials in generators with minimal length. We further utilize normal form to give explicit…

Representation Theory · Mathematics 2020-01-01 D. Bulgakova , Y. Goncharov , O. Ogievetsky

We reduce the set of classic relational algebra operators to two binary operations: natural join and generalized union. We further demonstrate that this set of operators is relationally complete and honors lattice axioms.

Databases · Computer Science 2007-05-23 Vadim Tropashko