English
Related papers

Related papers: Satisfiability degrees for BCK-algebras

200 papers

We study the connection between the condition that the reduced C*-algebra of a finitely presented group is exact and the Novikov conjecture holding. The main result states that if the group is strongly exact in the sense that the inclusion…

Operator Algebras · Mathematics 2007-05-23 Erik Guentner , Jerome Kaminker

In this paper we study satisfiability of random equations in an infinite finitely generated nilpotent group G. We show that the set SAT(G,k) of all equations in k > 1 variables over G which are satisfiable in G has an intermediate…

Group Theory · Mathematics 2011-06-10 Robert Gilman , Alexei Myasnikov , Vitalii Romankov

We use high girth, high chromatic number hypergraphs to show that there are finite models of the equational theory of the semiring of nonnegative integers whose equational theory has no finite axiomatisation, and show this also holds if…

Logic · Mathematics 2026-02-12 Tumadhir Alsulami , Marcel Jackson

Let $b_{\ell, k}(n), b_{\ell, k, r}(n)$ count the number of $(\ell, k)$, $(\ell, k, r)$-regular partitions respectively. In this paper we shall derive infinite families of congruences for $b_{\ell, k}(n)$ modulo $2$ when $ (\ell, k) =…

Number Theory · Mathematics 2023-03-27 T Kathiravan , K Srinivas , Usha K Sangale

We prove that for any positive integer c there are at least N(c), $1\leq N(c) < \phi(c)/2$ representations of c as a sum of two positive integers a, b, with no common divisor, such that the N(c) radicals R(abc) are all greater than kc,…

Number Theory · Mathematics 2007-05-23 Constantin M. Petridi

Mermin and Peres showed that there are boolean constraint systems (BCSs) which are not satisfiable, but which are satisfiable with quantum observables. This has led to a burgeoning theory of quantum satisfiability for constraint systems,…

Quantum Physics · Physics 2025-01-16 Connor Paddock , William Slofstra

We prove several decidability and undecidability results for the satisfiability and validity problems for languages that can express solutions to word equations with length constraints. The atomic formulas over this language are equality…

Logic in Computer Science · Computer Science 2013-06-26 Vijay Ganesh , Mia Minnes , Armando Solar-Lezama , Martin Rinard

We consider inductive systems of C*-algebras with completely positive contractive connecting maps. We define a condition, called C*-encoding, which is sufficient for the limit of the system to be completely order isomorphic to a C*-algebra…

Operator Algebras · Mathematics 2023-06-26 Kristin Courtney

Lance Bryant noticed in his thesis that there was a flaw in our paper "Associated graded rings of one-dimensional analytically irreducible rings", J. Algebra 304 (2006), 349-358. It can be fixed by adding a condition, called the BF…

Commutative Algebra · Mathematics 2010-11-19 Valentina Barucci , Ralf Fröberg

We classify essential algebras whose irredundant non-refinable covers consist of primal algebras. The proof is obtained by constructing one to one correspondence between such algebras and partial orders on finite sets. Further, we prove…

Logic · Mathematics 2014-06-26 Shohei Izawa

An automaton is unambiguous if for every input it has at most one accepting computation. An automaton is k-ambiguous (for k > 0) if for every input it has at most k accepting computations. An automaton is boundedly ambiguous if it is…

Logic in Computer Science · Computer Science 2023-06-22 Alexander Rabinovich , Doron Tiferet

The problem of making practical, useful goodness of fit tests in the Bayesian paradigm is largely open. We introduce a class of special cases (testing for uniformity: have the cards been shuffled enough; does my random generator work) and a…

Methodology · Statistics 2018-04-11 Persi Diaconis , Guanyang Wang

Many deep, mysterious connections have been observed between collections of mutually unbiased bases (MUBs) and combinatorial designs called $k$-nets (and in particular, between complete collections of MUBs and finite affine - or…

Mathematical Physics · Physics 2019-07-05 Sloan Nietert , Zsombor Szilágyi , Mihály Weiner

The resolvability of equations in integers containing truncated Newton's binomial, is determined by the divisibility of the binomial by the characteristic parameters of the equation, which most often is the binomial exponent. Two types of…

General Mathematics · Mathematics 2014-06-23 Anatoly A. Grinberg

We consider the problem of constructing distribution-free prediction sets with finite-sample conditional guarantees. Prior work has shown that it is impossible to provide exact conditional coverage universally in finite samples. Thus, most…

Methodology · Statistics 2024-09-18 Isaac Gibbs , John J. Cherian , Emmanuel J. Candès

In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…

Computational Complexity · Computer Science 2016-08-15 Peter Franek , Stefan Ratschan , Piotr Zgliczynski

The following integrability theorem for vertex operator algebras V satisfying some finiteness conditions(C_2-cofinite and CFT-type) is proved: the vertex operator subalgebra generated by a simple Lie subalgebra {\frak g} of the weight one…

Quantum Algebra · Mathematics 2007-05-23 Chongying Dong , Geoffrey Mason

We give a survey on the theory of representation-finite and certain minimal representation-infinite algebras.The main goals are the existence of multiplicative bases and of coverings with good properties. Both are attained via…

Representation Theory · Mathematics 2013-02-06 Klaus Bongartz

In this paper, we show that coherent sets of gambles and coherent lower and upper previsions can be embedded into the algebraic structure of information algebra. This leads firstly, to a new perspective of the algebraic and logical…

Artificial Intelligence · Computer Science 2021-04-28 Arianna Casanova , Juerg Kohlas , Marco Zaffalon

Let $\mathfrak{g}$ be a Kac-Moody algebra and $\mathfrak{b}_1, \mathfrak{b}_2$ be Borel subalgebras of opposite signs. The intersection $\mathfrak{b} = \mathfrak{b}_1 \cap \mathfrak{b}_2$ is a finite-dimensional solvable subalgebra of…

Rings and Algebras · Mathematics 2010-02-08 Pierre-Emmanuel Caprace
‹ Prev 1 3 4 5 6 7 10 Next ›