English
Related papers

Related papers: Presentations of pseudodistributive laws

200 papers

We study the modular representation theory of the symmetric and alternating groups. One of the most natural ways to label the irreducible representations of a given group or algebra in the modular case is to show the unitriangularity of the…

Representation Theory · Mathematics 2020-12-09 Olivier Brunat , Jean-Baptiste Gramain , Nicolas Jacon

This article brings in two new discrete distributions: multidimensional Binomial distribution and multidimensional Poisson distribution. Those distributions were created in eventology as more correct generalizations of Binomial and Poisson…

General Mathematics · Mathematics 2011-02-23 Oleg Yu. Vorobyev , Lavrentiy S. Golovkov

Perfect paradefinite algebras are De Morgan algebras expanded with an operation that allows for the full behavior of classical negation to be restored. They form a variety that is term-equivalent to the variety of involutive Stone algebras.…

Logic in Computer Science · Computer Science 2025-03-12 Vitor Greati , Sérgio Marcelino , João Marcos , Umberto Rivieccio

Generalizing the concept of primary fields, we find a new representation of the Virasoro algebra, which we call it a pseudo-conformal representation. In special cases, this representation reduces to ordinary- or logarithmic-conformal field…

High Energy Physics - Theory · Physics 2015-06-26 A. Aghamohammadi , A. Alimohammadi , M. Khorrami

In this expository article, we give a self-contained introduction to the wonderfully well-behaved class of pseudocompact algebras, focusing on the foundational classes of semisimple and separable algebras. We give characterizations of such…

Rings and Algebras · Mathematics 2025-01-20 Kostiantyn Iusenko , John MacQuarrie

We develop the theory of strong and commutative monads in the 2-dimensional setting of bicategories. This provides a framework for the analysis of effects in many recent models which form bicategories and not categories, such as those based…

Logic in Computer Science · Computer Science 2024-06-12 Hugo Paquet , Philip Saville

It is known that exactly eight varieties of Heyting algebras have a model-completion, but no concrete axiomatisation of these model-completions were known by now except for the trivial variety (reduced to the one-point algebra) and the…

Logic · Mathematics 2017-05-30 Luck Darnière , Markus Junker

A family of the billiard-type systems with zero Lyapunov exponent is considered as an example of dynamics which is between the regular one and chaotic mixing. This type of dynamics is called ``pseudochaos''. We demonstrate how the…

Chaotic Dynamics · Physics 2007-05-23 G. M. Zaslavsky , M. Edelman

Consider a linear ordering equipped with a finite sequence of monadic predicates. If the ordering contains an interval of order type \omega or -\omega, and the monadic second-order theory of the combined structure is decidable, there exists…

Logic in Computer Science · Computer Science 2015-07-01 Alexis Bes , Alexander Rabinovich

One discusses a problem of asymptotical behavior for some operators in a general theory of pseudo differential equations on manifolds with borders. Using the distribution theory one obtains certain explicit representations for these…

Analysis of PDEs · Mathematics 2015-12-29 Vladimir B. Vasilyev

With the use of two kinds of boson operators, a new boson representation of the su(2)-algebra is proposed. The basic idea comes from the pseudo su(1,1)-algebra recently given by the present authors. It forms a striking contrast to the…

Nuclear Theory · Physics 2015-04-08 Yasuhiko Tsue , Constanca Providencia , Joao da Providencia , Masatoshi Yamamura

We prove a biadjoint triangle theorem and its strict version, which are $2$-dimensional analogues of the adjoint triangle theorem of Dubuc. Similarly to the $1$-dimensional case, we demonstrate how we can apply our results to get the…

Category Theory · Mathematics 2019-02-05 Fernando Lucatelli Nunes

Containers are used to carve out a class of strictly positive data types in terms of shapes and positions. They can be interpreted via a fully-faithful functor into endofunctors on Set. Monadic containers are those containers whose…

Logic in Computer Science · Computer Science 2025-06-16 Chris Purdy , Stefania Damato

We present a framework which allows a uniform approach to the recently introduced concept of pseudo-repetitions on words in the morphic case. This framework is at the same time more general and simpler. We introduce the concept of a…

Formal Languages and Automata Theory · Computer Science 2020-04-03 Štěpán Holub

A deformed differential calculus is developed based on an associative star-product. In two dimensions the Hamiltonian vector fields model the algebra of pseudo-differential operator, as used in the theory of integrable systems. Thus one…

High Energy Physics - Theory · Physics 2020-12-16 I. A. B. Strachan

We classify the 5-dimensional homogeneous geometries in the sense of Thurston. The present paper (part 3 of 3) classifies those in which the linear isotropy representation is nontrivial but reducible. Most of the resulting geometries are…

Geometric Topology · Mathematics 2016-05-25 Andrew Geng

Turi and Plotkin introduced an elegant approach to structural operational semantics based on universal coalgebra, parametric in the type of syntax and the type of behaviour. Their framework includes abstract GSOS, a categorical…

Logic in Computer Science · Computer Science 2017-09-05 Jurriaan Rot

We give criteria for real, complex and quaternionic representations to define s-representations, focusing on exceptional Lie algebras defined by spin representations. As applications, we obtain the classification of complex representations…

Differential Geometry · Mathematics 2019-01-08 Andrei Moroianu , Uwe Semmelmann

We present an algorithm for deriving a spatial-behavioral type system from a formal presentation of a computational calculus. Given a 2-monad Calc: Catv$\to$ Cat for the free calculus on a category of terms and rewrites and a 2-monad…

Logic in Computer Science · Computer Science 2016-10-18 Mike Stay , Lucius Gregory Meredith

It is well-known that intuitionistic logics can be formalized by means of Brouwerian semilattices, i.e. relatively pseudocomplemented semilattices. Then the logical connective implication is considered to be the relative pseudocomplement…

Logic · Mathematics 2023-01-06 Ivan Chajda , Helmut Länger
‹ Prev 1 3 4 5 6 7 10 Next ›