English
Related papers

Related papers: Composition closed premodel structures and the Kre…

200 papers

In this paper, we initiate the study of the twisted weak order associated to a twisted Bruhat order for a Coxeter group and explore the relationship between the lattice property of such order and the infinite reduced words. We show that for…

Representation Theory · Mathematics 2018-12-19 Weijia Wang

We introduce evolving networks where new vertices preferentially connect to the more central parts of a network. This makes such networks compact. Finite networks grown under the preferential compactness mechanism have complex…

Disordered Systems and Neural Networks · Physics 2007-05-23 M. J. Alava , S. N. Dorogovtsev

Continuous reducibilities are a proven tool in computable analysis, and have applications in other fields such as constructive mathematics or reverse mathematics. We study the order-theoretic properties of several variants of the two most…

Logic in Computer Science · Computer Science 2010-10-22 Arno Pauly

We consider formal power series $f(z) = \omega z + a_2z^2 + \ldots \ (\omega \neq 0)$, with coefficients in a field of characteristic $0$. These form a group under the operation of composition (= substitution). We prove (Theorem 1) that…

Combinatorics · Mathematics 2018-06-04 Marshall M. Cohen

We consider a particular type of matrices which belong at the same time to the class of Hessenberg and Toeplitz matrices, and whose determinants are equal to the number of a type of compositions of natural numbers. We prove a formula in…

Combinatorics · Mathematics 2010-07-06 Milan Janjic

Alt $\nu$-Tamari lattices constitute a remarkable family of lattices associated with lattice paths that broadly generalize the Dyck and Tamari lattices. To systematically study the structural properties of this family, we introduce a…

Combinatorics · Mathematics 2026-05-14 Matthias Müller

We consider lattice analogues of some conformal theories, including WZW and Toda models. We describe discrete versions of Drinfeld-Sokolov reduction and Sugawara construction for the WZW model. We formulate perturbation theory in chiral…

High Energy Physics - Theory · Physics 2015-06-26 A. V. Antonov , A. A. Belov , K. Chaltikian

We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…

Combinatorics · Mathematics 2026-04-22 Victoria Ironmonger , Nik Ruškuc

In [1] the authors showed some basic properties of a pre-order that arose in combinatorial number theory, namely the finite embeddability between sets of natural numbers, and they presented its generalization to ultrafilters, which is…

Logic · Mathematics 2014-06-13 Lorenzo Luperi Baglini

We introduce permutrees, a unified model for permutations, binary trees, Cambrian trees and binary sequences. On the combinatorial side, we study the rotation lattices on permutrees and their lattice homomorphisms, unifying the weak order,…

Combinatorics · Mathematics 2023-11-14 Vincent Pilaud , Viviane Pons

We investigate a poset structure that extends the weak order on a finite Coxeter group $W$ to the set of all faces of the permutahedron of $W$. We call this order the facial weak order. We first provide two alternative characterizations of…

Combinatorics · Mathematics 2023-11-14 Aram Dermenjian , Christophe Hohlweg , Vincent Pilaud

Brauer and Thrall conjectured that a finite-dimensional algebra over a field of bounded representation type is actually of finite representation type and a finite-dimensional algebra (over an infinite field) of infinite representation type…

Representation Theory · Mathematics 2018-05-25 Fahimeh Sadat Fotouhi , Alex Martsinkovsky , Shokrollah Salarian

The paper shows that there is a deep structure on certain sets of bisimilar Probabilistic Automata (PA). The key prerequisite for these structures is a notion of compactness of PA. It is shown that compact bisimilar PA form lattices. These…

Formal Languages and Automata Theory · Computer Science 2014-02-28 Johann Schuster , Markus Siegle

Let H and K be finite composition series of a group G. The intersections H_i\cap K_j of their members form a lattice CSL(H,\K) under set inclusion. Improving the Jordan-H\"older theorem, G. Gr\"atzer, J.B. Nation and the present authors…

Rings and Algebras · Mathematics 2013-01-10 Gabor Czedli , E. Tamas Schmidt

We analyze the properties of weakly compact sets in Lipschitz free spaces. Prior research has established that, for a complete metric space $M$, weakly precompact sets in the Lipschitz free space $\mathcal F(M)$ are tight. In this paper, we…

Functional Analysis · Mathematics 2026-02-16 Ramón J. Aliaga , Colin Petitjean , Antonín Prochazka , Triinu Veeorg

Polar orderings arose in recent work of Salvetti and the second author on minimal CW-complexes for complexified hyperplane arrangements. We study the combinatorics of these orderings in the classical framework of oriented matroids, and…

Combinatorics · Mathematics 2012-10-26 Emanuele Delucchi , Simona Settepanella

For a presentation $\mathcal{A}$ of a transversal matroid $M$, we study the set $T_{\mathcal{A}}$ of single-element transversal extensions of $M$ that have presentations that extend $\mathcal{A}$; we order these extensions by the weak…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin

We study the appearance of notable interval structures -- lattices, modular lattices, distributive lattices, and boolean lattices -- in both the Bruhat and weak orders of Coxeter groups. We collect and expand upon known results for…

Combinatorics · Mathematics 2021-03-12 Bridget Eileen Tenner

We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong…

Combinatorics · Mathematics 2021-04-05 Elisa Palezzato , Michele Torielli

We study preorders on (equivalence classes of) maximal chains in the general context of polygonal lattices endowed with suitably nice edge labellings. We show that, given a quotient of polygonal lattices, such edge labellings descend to the…

Combinatorics · Mathematics 2025-06-11 Mikhail Gorsky , Nicholas J. Williams
‹ Prev 1 3 4 5 6 7 10 Next ›