相关论文: Rectangular loops and rectangular quasigroups

Satisfiability problems play a central role in computer science and engineering as a general framework for studying the complexity of various problems. Schaefer proved in 1978 that truth satisfaction of propositional formulas given a…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

We consider walks on the edges of the square lattice $\mathbb Z^2$ which obey \emph{two-step rules,} which allow (or forbid) steps in a given direction to be followed by steps in another direction. We classify these rules according to a…

It is an old conjecture, that finite $H$-spaces are homotopy equivalent to manifolds. Here we prove that this conjecture is true for loop spaces. Actually, we show that every quasi finite loop space is equivalent to a stably parallelizable…

Circular proofs, introduced by Daniyar Shamkanov, are proofs in which assumptions are allowed that are not axioms but do appear at least twice along a branch. Shamkanov has shown that a formula belongs to the provability logic GL exactly if…

Mathematical theories are classified in two distinct classes : {\it rigid}, and on the other hand, {\it non-rigid} ones. Rigid theories, like group theory, topology, category theory, etc., have a basic concept - given for instance by a set…

We study a notion of curvature for finitely generated groups which serves as a role of Ricci curvature for Riemannian manifolds. We prove an analog of Cheeger-Gromoll splitting theorem. As a consequence, we give a geometric characterization…

We present a method of computing any one-loop integral in lattice perturbation theory by systematically expanding around its continuum limit. At any order in the expansion in the lattice spacing, the result can be written as a sum of…

The principles of the theory of quantum groups are reviewed from the point of view of the possibility of their use for deformations of symmetries in physical models. The R-matrix approach to the theory of quantum groups is discussed in…

This article has been written for an educational magazine whose target audience consists of students and teachers of mathematics in universities, colleges and schools. It concerns a notion of duality between rectangles. A proof is given…

The aim of this paper is to establish two results about multiplicity of solutions to problems involving the $1-$Laplacian operator, with nonlinearities with critical growth. To be more specific, we study the following problem $$ \left\{…

Every finitely generated self-similar group naturally produces an infinite sequence of finite $d$-regular graphs $\Gamma_n$. We construct self-similar groups, whose graphs $\Gamma_n$ can be represented as an iterated zig-zag product and…

We extend logical categories with fiberwise interior and closure operators so as to obtain an embedding theorem into powers of the category of topological spaces. The required axioms, besides the Kuratowski closure axioms, are a `product…

Let Gamma be a group generated by two positive multi-twists. We give some sufficient conditions for Gamma to be free or have no `unexpectedly reducible' elements. For a group Gamma generated by two Dehn twists, we classify the elements in…

Hyland's effective topos offers an important realizability model for constructive mathematics in the form of a category whose internal logic validates Church's Thesis. It also contains a boolean full sub-quasitopos of "assemblies" where…

Full set of autonomous completely solvable differential systems of equations in total differentials is built by basis of infinitesimal operators, universal invariant, and structure constants of admited multiparametric Lie group (abelian and…

We give an algorithm for solving equations and inequations with rational constraints in virtually free groups. Our algorithm is based on Rips classification of measured band complexes. Using canonical representatives, we deduce an algorithm…

Automated Theorem Proving (ATP) in formal languages is a foundational challenge for AI. While Large Language Models (LLMs) have driven remarkable progress, a significant gap remains between their powerful informal reasoning capabilities and…

We introduce a finite version of free probability for rectangular matrices that amounts to operations on singular values of polynomials. We show that we can replicate the transforms from free probability, and that asymptotically there is…

When the standard representation of a crystallographic Coxeter group $\Gamma$ is reduced modulo an odd prime $p$, a finite representation in some orthogonal space over $\mathbb{Z}_p$ is obtained. If $\Gamma$ has a string diagram, the latter…