English
Related papers

Related papers: Depth of Boolean algebras

200 papers

We study connections among polynomials, differential equations and streams over a field K, in terms of algebra and coalgebra. We first introduce the class of (F,G)-products on streams, those where the stream derivative of a product can be…

Formal Languages and Automata Theory · Computer Science 2024-05-24 Michele Boreale , Daniele Gorla

We extend Makkai duality between coherent toposes and ultracategories to a duality between toposes with enough points and ultraconvergence spaces. Our proof generalizes and simplifies Makkai's original proof. Our main result can also be…

Category Theory · Mathematics 2026-02-24 Sam van Gool , Jérémie Marquès , Umberto Tarantino

Constructive meaning is given to the assertion that every finite Boolean algebra is an injective object in the category of distributive lattices. To this end, we employ Scott's notion of entailment relation, in which context we describe…

Logic in Computer Science · Computer Science 2023-06-22 Davide Rinaldi , Daniel Wessel

The original theme of the paper is the existence proof of ``there is < eta_alpha : alpha < lambda > which is a (lambda,J)-sequence for < I_i:i<delta >, a sequence of ideals. This can be thought of as in a generalization to Luzin sets and…

Logic · Mathematics 2016-09-07 Saharon Shelah

The author has previously shown that solvable Lie A-algebras and complemented solvable Lie algebras decompose as a vector space direct sum of abelian subalgebras, and their ideals relate nicely to this decomposition. However, neither of…

Rings and Algebras · Mathematics 2013-05-06 David A. Towers

In a previous publication, we introduced an abstract logic via an abstract notion of quantifier. Drawing upon concepts from categorical logic, this abstract logic interprets formulas from context as subobjects in a specific category, e.g.,…

Logic in Computer Science · Computer Science 2024-07-08 Marc Aiguier , Isabelle Bloch , Romain Pascual

We find a strong separation between two natural families of simple rank one theories in Keisler's order: the theories $T_\mathfrak{m}$ reflecting graph sequences, which witness that Keisler's order has the maximum number of classes, and the…

Logic · Mathematics 2023-07-06 M. Malliaris , S. Shelah

We define a notion of depth for an inclusion of multimatrix algebras B < A based on a comparison of powers of the induction-restriction table M (and its transpose matrix). This notion of depth coincides with the depth from [Kadison, 2008].…

Group Theory · Mathematics 2010-02-09 Sebastian Burciu , Lars Kadison , Burkhard Kuelshammer

In this paper we improve the level and sublevel of algebras obtained by the Cayley-Dickson process when their level and sublevel are greater than dimension of the algebras.

Rings and Algebras · Mathematics 2017-04-05 Cristina Flaut

In this article, we give a family of examples of algebras, showing that for every $n \geq 2$ and $m \geq 0$, there is an algebra displaying a path of n irreducible morphisms between indecomposable modules whose composite lies in the…

Representation Theory · Mathematics 2025-07-14 Viktor Chust , Flávio U. Coelho

The depth rule is a level truncation of tensor product coefficients expected to be sufficient for the evaluation of fusion coefficients. We reformulate the depth rule in a precise way, and show how, in principle, it can be used to calculate…

High Energy Physics - Theory · Physics 2009-10-22 A. N. Kirillov , P. Mathieu , D. Senechal , M. Walton

We produce algorithms to detect whether a complex affine variety computed and presented numerically by the machinery of numerical algebraic geometry corresponds to an associated component of a polynomial ideal.

Algebraic Geometry · Mathematics 2016-01-15 Robert Krone , Anton Leykin

In this paper, we use G\"{o}del's incompleteness theorem as a case study for investigating mathematical depth. We take for granted the widespread judgment by mathematical logicians that G\"{o}del's incompleteness theorem is deep, and focus…

Logic · Mathematics 2022-11-08 Yong Cheng

We present the Boolean dimension of a graph, we relate it with the notions of inner, geometric and symplectic dimensions, and with the rank and minrank of a graph. We obtain an exact formula for the Boolean dimension of a tree in terms of a…

Combinatorics · Mathematics 2022-09-07 Maurice Pouzet , Hamza Si Kaddour , Bhalchandra D. Thatte

The theory of direct integral decompositions of both bounded and unbounded operators is further developed; in particular, results about spectral projections, functional calculus and affiliation to von Neumann algebras are proved. For…

Operator Algebras · Mathematics 2015-09-14 Ken Dykema , Joseph Noles , Fedor Sukochev , Dmitriy Zanin

We introduce Poisson double algebroids, and the equivalent concept of double Lie bialgebroid, which arise as second-order infinitesimal counterparts of Poisson double groupoids. We develop their underlying Lie theory, showing how these…

Symplectic Geometry · Mathematics 2022-07-14 Henrique Bursztyn , Alejandro Cabrera , Matias del Hoyo

Tensor products of ultrafilters have special combinatorial features closely related to Ramsey's Theorem, making them useful tools in applications. Here we first review their fundamental properties and isolate some new ones, including a…

Combinatorics · Mathematics 2025-06-18 Mauro Di Nasso

In previous work we have shown that classical approximation theory provides methods for the systematic construction of inverse-closed smooth subalgebras. Now we extend this work to treat inverse-closed subalgebras of ultradifferentiable…

Functional Analysis · Mathematics 2012-01-17 Andreas Klotz

This paper approaches, using structural complexity theory, the question of whether there is a chasm between knowing an object exists and getting one's hands on the object or its properties. In particular, we study the nontransparency of…

Artificial Intelligence · Computer Science 2019-01-15 Lane A. Hemaspaandra , David E. Narváez

We show that each member of a doubly infinite sequence of highly nonlinear expressions of Bernoulli polynomials, which can be seen as linear combinations of certain higher-order convolutions, is a multiple of a specific product of linear…

Number Theory · Mathematics 2019-03-29 Karl Dilcher , Armin Straub , Christophe Vignat