Related papers: A structural view of maximal green sequences

For an algebraic number $\alpha$ we consider the orders of the reductions of $\alpha$ in finite fields. In the case where $\alpha$ is an integer, it is known by the work on Artin's primitive root conjecture that the order is "almost always…

In this paper, we will consider a class of locally $\Phi$-Beilinson-Green algebras, where $\Phi$ is an infinite admissible set of the integers, and show that symmetric approximation sequences in $n$-exangulated categories give rise to…

We use $\tau$-tilting theory to give a description of the wall and chamber structure of a finite dimensional algebra. We also study $\mathfrak{D}$-generic paths in the wall and chamber structure of an algebra $A$ and show that every maximal…

The authors developed in a recent paper natural dualities for finitely generated quasivarieties of Sugihara algebras. They thereby identified the admissibility algebras for these quasivarieties which, via the Test Spaces Method devised by…

We show that it is consistent relative to ZF, that there is no well-ordering of $\mathbb{R}$ while a wide class of special sets of reals such as Hamel bases, transcendence bases, Vitali sets or Bernstein sets exists. To be more precise, we…

In this paper, we construct derived equivalences between certain Nakayama algebras by using the notion of an S-family which is a family of objects in a triangulated category satisfying some axioms.

We study the well-quasi-order (wqo) consisting of the set of finite trees with leaf labels coming from an arbitrary wqo $Q$, ordered by tree homomorphisms which respect the order on the labels. This is a variant of the usual Kruskal tree…

We prove the conjecture that the higher Tamari orders of Dimakis and M\"uller-Hoissen coincide with the first higher Stasheff--Tamari orders. To this end, we show that the higher Tamari orders may be conceived as the image of an…

Termination property of functions is an important issue in computability theory. In this paper, we show that repeated iterations of a function can induce an order amongst the elements of its domain set. Hasse diagram of the poset, thus…

We study the number of linear extensions of a partial order with a given proportion of comparable pairs of elements, and estimate the maximum and minimum possible numbers. We also consider a random interval partial order on $n$ elements,…

Let $k$ be a number field and $B$ be a central simple algebra over $k$ of dimension $p^2$ where $p$ is prime. In the case that $p=2$ we assume that $B$ is not totally definite. In this paper we study sets of pairwise nonisomorphic maximal…

Stanley's inequalities for partially ordered sets establish important log-concavity relations for sequences of linear extensions counts. Their extremals however, i.e., the equality cases of these inequalities, were until now poorly…

We investigate how the higher almost split sequences over a tensor product of algebras are related to those over each factor. Herschend and Iyama gave a precise criterion for when the tensor product of an $n$-representation finite algebra…

We obtain new non-asymptotic tail bounds for the height of uniformly random trees with a given degree sequence, simply generated trees and conditioned Bienaym\'e trees (the family trees of branching processes), in the process settling three…

We investigate the rich combinatorial structure of premodel structures on finite lattices whose weak equivalences are closed under composition. We prove that there is a natural refinement of the inclusion order of weak factorization systems…

Well-quasi orders such as homeomorphic embedding are commonly used to ensure termination of program analysis and program transformation, in particular supercompilation. We compare eight well-quasi orders on how discriminative they are and…

Koszul algebras have arisen in many contexts; algebraic geometry, combinatorics, Lie algebras, non-commutative geometry and topology. The aim of this paper and several sequel papers is to show that for any finite dimensional algebra there…

We study a circular order on labelled, m-edge-coloured trees with k vertices, and show that the set of such trees with a fixed circular order is in bijection with the set of RNA m-diagrams of degree k, combinatorial objects which can be…

Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…

Semifields are semirings in which every nonzero element has a multiplicative inverse. A rough classification uses the characteristic of the semifield, that is the isomorphism type of the semifield generated by the two neutral elements. For…