Results 81 to 90 of about 6,492 (203)
Free Algebras Over a Poset in Varieties of Łukasiewicz–Moisil Algebras
A general construction of the free algebra over a poset in varieties finitely generated is given in [8]. In this paper, we apply this to the varieties of Łukasiewicz-Moisil algebras, giving a detailed description of the free algebra over a finite poset ...
Orellano A. Figallo, Gallardo C.
doaj +1 more source
Graph Orientations and Linear Extensions. [PDF]
Given an underlying undirected simple graph, we consider the set of all acyclic orientations of its edges. Each of these orientations induces a partial order on the vertices of our graph, and therefore we can count the number of linear extensions of ...
Benjamin Iriarte
doaj +1 more source
Localization sequences for logarithmic topological cyclic homology
Abstract We introduce the notion of an Ek$\mathbb {E}_k$‐ring with prelogarithmic structure, define logarithmic topological Hochschild homology and logarithmic topological cyclic homology in this context, and establish localization sequences for these theories. Our approach is based on Thom R$R$‐algebras.
John Rognes +2 more
wiley +1 more source
We define families of posets, ordered by prefixes, as the counterpart of the usual families of configurations ordered by subsets. On these objects we define two types of morphism, event and order morphisms, resulting in categories FPos and FPosv. We then show the following: - Families of posets, in contrast to families of configurations, are always ...
openaire +3 more sources
Group of Isometries of Niederreiter-Rosenbloom-Tsfasman Block Space
Let P = ({1, 2, ..., n}, ≤) be a poset that is an union of disjoint chains of the same length and V = F^N_q be the space of N-tuples over the finite field Fq.
L. Panek, N. M. P. Panek
doaj +1 more source
How to see the forest despite the trees
Abstract One of the major starting points of discrete optimization is the theorem of Nash‐Williams and Tutte on the existence of k$k$ disjoint spanning trees of a graph, along with its counterpart on the existence of k$k$ forests covering all edges of the graph.
Erika Bérczi‐Kovács, András Frank
wiley +1 more source
The asymptotic Mahler measure of Gaussian periods
Abstract We construct a sequence of cyclotomic integers (Gaussian periods) of particularly small Mahler measure/height. We study the asymptotics of their Mahler measure as a function of their conductor, to find that the growth rate is the (multivariate) Mahler measure of a family of log Calabi–Yau varieties of increasing dimension.
Gunther Cornelissen +2 more
wiley +1 more source
The Poset of Proper Divisibility [PDF]
We study the partially ordered set $P(a_1,\ldots, a_n)$ of all multidegrees $(b_1,\dots,b_n)$ of monomials $x_1^{b_1}\cdots x_n^{b_n}$ which properly divide $x_1^{a_1}\cdots x_n^{a_n}$. We prove that the order complex $Δ(P(a_1,\dots,a_n))$ of $P(a_1,\ldots a_n)$ is (non-pure) shellable, by showing that the order dual of $P(a_1,\ldots,a_n)$ is $\mathrm ...
Bolognini, Davide +4 more
openaire +5 more sources
Entropía algebraica de un poset [PDF]
El propósito de este trabajo es definir la noción de entropía algebraica sobre un poset con el fin de probar algunos resultados clásicos de la teoría de representaciones de posets.
Cubillos Delgado, Alfonso
core
Poset boxicity of graphs [PDF]
A t-box representation of a graph encodes each vertex as a box in t-space determined by the (integer) coordinates of its lower and upper corner, such that vertices are adjacent if and only if the corresponding boxes intersect.
Trotter, W.T, West, Douglas B
core +1 more source

