English
Related papers

Related papers: The hereditariness problem for the \v{C}ern\'y con…

200 papers

We consider three lifting questions: Given a $C\sp{*}$-algebra $I$, if there is a unital $C\sp{*}$-algebra $A$ contains $I$ as an ideal, is every unitary from $A/I$ lifted to a unitary in $A$? is every unitary from $A/I$ lifted to an…

Operator Algebras · Mathematics 2008-11-11 Hyun Ho Lee

Motivated by the Babai conjecture and the Cerny conjecture, we study the reset thresholds of automata with the transition monoid equal to the full monoid of transformations of the state set. For automata with $n$ states in this class, we…

Formal Languages and Automata Theory · Computer Science 2017-08-08 François Gonze , Vladimir Gusev , Balázs Gerencsér , Raphaël M. Jungers , Mikhail V. Volkov

We use Quillen model structures to show a systematic method to lift recollements of hereditary abelian model categories to recollements of their associated homotopy categories. To that end, we use the notion of Quillen adjoint triples and…

Category Theory · Mathematics 2023-02-20 Georgios Dalezios , Chrysostomos Psaroudakis

The McCarty Conjecture states that any McCarty Matrix (an $n\times n$ matrix $A$ with positive integer entries and each of the $2n$ row and column sums equal to $n$), can be additively decomposed into two other matrices, $B$ and $C$, such…

Combinatorics · Mathematics 2025-05-08 Anant Godbole , Lybitina Koene , Grant Shirley

The graph reconstruction conjecture asserts that every simple graph on at least three vertices is uniquely determined by its deck of vertex-deleted subgraphs. In this expository article we survey the conjecture and present an…

Combinatorics · Mathematics 2026-04-21 Emilie Dufresne , Gabriela Jeronimo , Jenny Kenkel , Haydee Lindo , Nelly Villamizar

Combining a standard proof search method, such as resolution or tableaux, and rewriting is a powerful way to cut off search space in automated theorem proving, but proving the completeness of such combined methods may be challenging. It may…

Logic in Computer Science · Computer Science 2023-06-02 Gilles Dowek

Strassen's asymptotic rank conjecture [Progr. Math. 120 (1994)] claims a strong submultiplicative upper bound on the rank of a three-tensor obtained as an iterated Kronecker product of a constant-size base tensor. The conjecture, if true,…

Data Structures and Algorithms · Computer Science 2023-10-19 Andreas Björklund , Petteri Kaski

Deciding whether an ideal of a number field is principal and finding a generator is a fundamental problem with many applications in computational number theory. For indefinite quaternion algebras, the decision problem reduces to that in the…

Number Theory · Mathematics 2014-08-13 Aurel Page

The Andrews-Curtis conjecture claims that every balanced presentation of the trivial group can be reduced to the standard one by a sequence of ``elementary transformations" which are Nielsen transformations augmented by arbitrary…

Group Theory · Mathematics 2007-05-23 Alexei D. Myasnikov , Alexei G. Myasnikov , Vladimir Shpilrain

In our recent paper we suggested a natural construction of the classical relativistic integrable tops in terms of the quantum $R$-matrices. Here we study the simplest case -- the 11-vertex $R$-matrix and related ${\rm gl}_2$ rational…

Mathematical Physics · Physics 2015-06-19 A. Levin , M. Olshanetsky , A. Zotov

Let $V$ be a $G$-module where $G$ is a complex reductive group. Let $Z:=\quot VG$ denote the categorical quotient and let $\pi\colon V\to Z$ be the morphism dual to the inclusion $\O(V)^G\subset\O(V)$. Let $\phi\colon Z\to Z$ be an…

Group Theory · Mathematics 2014-02-26 Gerald W. Schwarz

The intention of the present study is to establish the mathematical fundamentals for automated problem solving essentially targeted for robotics by approaching the task universal algebraically introducing knowledge as realizations of…

Logic in Computer Science · Computer Science 2014-08-07 Seppo Ilari Tirri

We prove a generalized version of Renault's theorem for Cartan subalgebras. We show that the original assumptions of second countability and separability are not needed. This weakens the assumption of topological principality of the…

Operator Algebras · Mathematics 2022-02-01 Ali Imad Raad

We study in this paper Hida's p-adic Hecke algebra for GL_n over a CM field F. Hida has made a conjecture about the dimension of these Hecke algebras, which he calls the non-abelian Leopoldt conjecture, and shown that his conjecture in the…

Number Theory · Mathematics 2016-07-07 Chandrashekhar Khare , Jack A. Thorne

A formal series in noncommuting variables $\Sigma$ over the rationals is a mapping $\Sigma^* \to \mathbb Q$. We say that a series is commutative if the value in the output does not depend on the order of the symbols in the input. The…

Formal Languages and Automata Theory · Computer Science 2025-05-19 Lorenzo Clemente

We are lifting classical problems from single instances to regular sets of instances. The task of finding a positive instance of the combinatorial problem $P$ in a potentially infinite given regular set is equivalent to the so called…

Formal Languages and Automata Theory · Computer Science 2020-07-17 Petra Wolf

We study transformations of automata and games using Muller conditions into equivalent ones using parity or Rabin conditions. We present two transformations, one that turns a deterministic Muller automaton into an equivalent deterministic…

Formal Languages and Automata Theory · Computer Science 2024-08-07 Antonio Casares , Thomas Colcombet , Nathanaël Fijalkow , Karoliina Lehtinen

We study some particular cases of Viterbo's conjecture relating volumes of convex bodies and actions of closed characteristics on their boundaries, focusing on the case of a Hamiltonian of classical mechanical type, splitting into summands…

Metric Geometry · Mathematics 2020-02-27 Roman Karasev , Anastasia Sharipova

We show that the freeness problems for automaton semigroups and for automaton monoids are undecidable and, thereby, solve an open problem listed by Grigorchuk, Nekrashevych and Sush\-chansk\u{\i}i. We achieve this using a new technique to…

Formal Languages and Automata Theory · Computer Science 2025-02-19 Daniele D'Angeli , Emanuele Rodaro , Jan Philipp Wächter

Take a cellular automaton, consider that each configuration is a basis vector in some vector space, and linearize the global evolution function. If lucky, the r esult could actually make sense physically, as a valid quantum evolution; but…

Quantum Physics · Physics 2009-03-03 Pablo Arrighi , Vincent Nesme