中文
相关论文

相关论文: Finite diamond-colored modular and distributive la…

200 篇论文

We elaborate on the notion of a filtration of an operad defined in terms of a lattice-valued operad serving as an indexing object. That covers ordinary integer-indexed filtrations of associative algebras and operads as a special case, yet…

环与代数 · 数学 2024-11-01 Denis Bashkirov

This paper addresses the combinatorial structure of $m$-colored mutation classes. We provide an explicit and purely combinatorial description of the $m$-colored quivers that arise within the $m$-colored mutation class of a quiver of type…

组合数学 · 数学 2025-12-24 Viviana Gubitosi , Pablo Rosero

In this paper we discuss the properties of the biordered set obtained from a complemented modular lattice and defines an operation using the sandwich elements of the biordered set. Further we describe a biordered subset satisfying certain…

环与代数 · 数学 2020-06-04 P. G. Romeo , Akhila. R

Borrowing some terminology from pro-p groups, thin Lie algebras are N-graded Lie algebras of width two and obliquity zero, generated in degree one. In particular, their homogeneous components have degree one or two, and they are termed…

环与代数 · 数学 2009-11-05 Sandro Mattarei , Marina Avitabile

In this paper we study the representation theory of the algebras generated by the single bond transfer matrices in dilute lattice models. This representation theory is related to a tensor product of monoidal categories. This construction is…

量子代数 · 数学 2007-05-23 Bruce W Westbury

Distributive laws give a way of combining two algebraic structures expressed as monads; in this paper we propose a theory of distributive laws for combining algebraic structures expressed as Lawvere theories. We propose four approaches,…

范畴论 · 数学 2024-08-07 Eugenia Cheng

In this article we investigate the lattices of Dyck paths of type $A$ and $B$ under dominance order, and explicitly describe their Heyting algebra structure. This means that each Dyck path of either type has a relative pseudocomplement with…

组合数学 · 数学 2017-08-08 Henri Mühle

We introduce a new type of diagrams and prove the existence of a particular one, the "central tuned diagram", with some optimal features, for finitely generated modules of certain categories. This is achieved by getting to the idea of "the…

表示论 · 数学 2016-05-31 Stephanos Gekas

An effective way to design structured coherent wave interference patterns that builds on the theory of coherent lattices, is presented. The technique combines prime number factorization in the complex plane with moir\'e theory to provide a…

斑图形成与孤子 · 物理学 2020-11-19 Dmitry Kouznetsov , Qingzhong Deng , Pol Van Dorpe , Niels Verellen

In the representation theory of real reductive Lie groups, many objects have finiteness properties. For example, the lengths of Verma modules and principal series representations are finite, and more precisely, they are bounded. In this…

表示论 · 数学 2021-09-22 Masatoshi Kitagawa

Recent papers in solvable lattice models emphasize models where states can be visualized as colored paths through the lattice. We define a bosonic model in which there are two types of colors, one whose paths move down and to the right, the…

组合数学 · 数学 2025-09-23 Talia Blum

We study the equational theory of the Weihrauch lattice with composition and iterations, meaning the collection of equations between terms built from variables, the lattice operations $\sqcup$, $\sqcap$, the composition operator $\star$ and…

计算机科学中的逻辑 · 计算机科学 2025-01-30 Cécilia Pradic

Associated to any finite simple graph $\Gamma$ is the chromatic polynomial $P_\Gamma(q)$ whose complex zeroes are called the chromatic zeros of $\Gamma$. A hierarchical lattice is a sequence of finite simple graphs…

数学物理 · 物理学 2021-03-23 Ivan Chio , Roland Roeder

Cographs are exactly the hereditarily well-colored graphs, i.e., the graphs for which a greedy vertex coloring of every induced subgraph uses only the minimally necessary number of colors $\chi(G)$. We show that greedy colorings are a…

In~\cite{Hartman:2014}, Hartman, Hubi\v cka and Ma\v sulovi\'c studied the hierarchy of morphism extension classes for finite $L$-colored graphs, that is, undirected graphs without loops where sets of colors selected from $L$ are assigned…

组合数学 · 数学 2018-05-07 Andrés Aranda , David Hartman

We study the list-chromatic number and the coloring number of graphs, especially uncountable graphs. We show that the coloring number of a graph coincides with its list-chromatic number provided that the diamond principle holds. Under the…

逻辑 · 数学 2021-12-30 Toshimichi Usuba

In this paper we study the poset of basic tilting $kQ$-modules when $Q$ is a Dynkin quiver, and the poset of basic support $\tau$-tilting $kQ$-modules when $Q$ is a connected acyclic quiver respectively. It is shown that the first poset is…

表示论 · 数学 2015-05-29 Yichao Yang

The methods of lattice gauge theory may be applied to gauge theories besides QCD, in fact to any gauge group and any representation of matter fields (as long as the coupling is not chiral). Such theories are useful for model building beyond…

高能物理 - 格点 · 物理学 2010-02-25 Benjamin Svetitsky

We study the equational theory of the Weihrauch lattice with multiplication, meaning the collection of equations between terms built from variables, the lattice operations $\sqcup$, $\sqcap$, the product $\times$, and the finite…

计算机科学中的逻辑 · 计算机科学 2024-09-05 Eike Neumann , Arno Pauly , Cécilia Pradic

We show that all balanced d-lattices must be complemented, answering a question of Chajda and Eigenthaler. (A bounded lattice is balanced if any two congruences agree on their 1-classes iff they agree on their 0-classes.) Our main tool is…

环与代数 · 数学 2007-05-23 Martin Goldstern , Miroslav Ploscica
‹ 上一页 1 8 9 10 下一页 ›