English
Related papers

Related papers: A mixed logic with binary operators

200 papers

We investigate border ranks of twisted powers of polynomials and smoothability of symmetric powers of algebras. We prove that the latter are smoothable. For the former, we obtain upper bounds for the border rank in general and prove that…

Algebraic Geometry · Mathematics 2025-09-01 Cosimo Flavi , Joachim Jelisiejew , Mateusz Michałek

Possibilistic logic offers a qualitative framework for representing pieces of information associated with levels of uncertainty of priority. The fusion of multiple sources information is discussed in this setting. Different classes of…

Artificial Intelligence · Computer Science 2013-01-18 Salem Benferhat , Didier Dubois , Souhila Kaci , Henri Prade

A bialgebra is a structure which is simultaneously an algebra and a coalgebra, such that the algebraic and coalgebraic parts are "compatible". Bialgebras are normally studied over a field or commutative ring. In this paper, we show how to…

Rings and Algebras · Mathematics 2009-10-30 James Worthington

We introduce the class of generalized biserial quiver algebras and prove that they provide a complete classification of all weakly symmetric biserial algebras over an algebraically closed field.

Representation Theory · Mathematics 2018-02-15 Rafał Bocian , Andrzej Skowroński

An equivalence between Lu's bialgebroids, Xu's bialgebroids with an anchor and Takeuchi's $\times_{A}$-bialgebras is explicitly proven. A new class of examples of bialgebroids is constructed. A (formal) dual of a bialgebroid, termed…

Quantum Algebra · Mathematics 2007-05-23 Tomasz Brzezinski , Gigel Militaru

A binary relation defined on a poset is a weakening relation if the partial order acts as a both-sided compositional identity. This is motivated by the weakening rule in sequent calculi and closely related to models of relevance logic. For…

Logic in Computer Science · Computer Science 2023-01-06 Peter Jipsen , Jaš Šemrl

We study the existence of the product of two weighted modulation spaces. For this purpose we discuss two different strategies. The more simple one allows transparent proofs in various situations. However, our second method allows a closer…

Functional Analysis · Mathematics 2016-02-02 Maximilian Reich , Winfried Sickel

A new class of languages of infinite words is introduced, called the max-regular languages, extending the class of $\omega$-regular languages. The class has two equivalent descriptions: in terms of automata (a type of deterministic counter…

Formal Languages and Automata Theory · Computer Science 2009-03-09 Mikolaj Bojanczyk

We study the binary choice problem in a data-rich environment with asymmetric loss functions. The econometrics literature covers nonparametric binary choice problems but does not offer computationally attractive solutions in data-rich…

Econometrics · Economics 2025-11-05 Andrii Babii , Xi Chen , Eric Ghysels , Rohit Kumar

A general notion of a quasi-finite algebra is introduced as an algebra graded by the set of all integers equipped with topologies on the homogeneous subspaces satisfying certain properties. An analogue of the regular bimodule is introduced…

Quantum Algebra · Mathematics 2007-05-23 Atsushi Matsuo , Kiyokazu Nagatomo , Akihiro Tsuchiya

Several open problems in algebraic logic are solved.

Logic · Mathematics 2013-04-05 Tarek Sayed Ahmed

We propose a generalisation of concurrent Kleene algebra \cite{Hoa09} that can take account of probabilistic effects in the presence of concurrency. The algebra is proved sound with respect to a model of automata modulo a variant of rooted…

Formal Languages and Automata Theory · Computer Science 2013-01-31 Annabelle McIver , Tahiry Rabehaja , Georg Struth

Using a binary representation for basis elements of an algebra combined with a framework of multiplier and index functions, a connection has been established between the structure of a large class of algebras and the XOR componentwise…

Mathematical Physics · Physics 2025-09-30 Derek Courchesne , Sébastien Tremblay

The foundational character of certain algebraic structures as Boolean algebras and Heyting algebras is rooted in their potential to model classical and constructive logic, respectively. In this paper we discuss the contributions of…

Rings and Algebras · Mathematics 2014-09-16 João Pita Costa , Primož Škraba , Mikael Vejdemo-Johansson

In recent work, comonads and associated structures have been used to analyse a range of important notions in finite model theory, descriptive complexity and combinatorics. We extend this analysis to Hybrid logic, a widely-studied extension…

Logic in Computer Science · Computer Science 2021-10-20 Samson Abramsky , Dan Marsden

Multiplier bimonoids (or bialgebras) in arbitrary braided monoidal categories are defined. They are shown to possess monoidal categories of comodules and modules. These facts are explained by the structures carried by their induced…

Quantum Algebra · Mathematics 2014-11-19 Gabriella Böhm , Stephen Lack

We present an expository overview of the monoidal structures in the category of linearly compact vector spaces. Bimonoids in this category are the natural duals of infinite-dimensional bialgebras. We classify the relations on words whose…

Combinatorics · Mathematics 2021-08-12 Eric Marberg

We consider how a vertex operator algebra can be extended to an abelian intertwining algebra by a family of weak twisted modules which are {\em simple currents} associated with semisimple weight one primary vectors. In the case that the…

q-alg · Mathematics 2009-10-28 Chongying Dong , Haisheng Li , Geoffrey Mason

We construct new examples of non-nil algebras with any number of generators, which are direct sums of two locally nilpotent subalgebras. As all previously known examples, our examples are contracted semigroup algebras and the underlying…

Rings and Algebras · Mathematics 2007-05-23 Vesselin Drensky , Lakhdar Hammoudi

Numerical characteristics of polynomial identities of left nilpotent algebras are examined. Previously, we came up with a construction which, given an infinite binary word, allowed us to build a two-step left nilpotent algebra with…

Rings and Algebras · Mathematics 2019-06-07 Mikhail V. Zaicev , Dušan D. Repovš