Related papers: Maximal green sequences for string algebras

This note presents a discussion of the algebraic and combinatorial aspects of the theory of pure O-sequences. Various instances where pure O-sequences appear are described. Several open problems that deserve further investigation are also…

We investigate the space of consistent tree-level extensions of the maximal supergravities in ten dimensions. We parametrize theory space by the first few EFT coefficients and by the on-shell coupling of the lightest massive state, and…

We study properties of minimal mutation-infinite quivers. In particular we show that every minimal-mutation infinite quiver of at least rank 4 is Louise and has a maximal green sequence. It then follows that the cluster algebras generated…

We give a proof of I. G. Rosenberg's characterization of maximal clones. The theorem lists six types of relations on a finite set such that a clone over this set is maximal if and only if it contains just the functions preserving one of the…

Let M be a maximal subalgebra of the Lie algebra L. A subalgebra C of L is said to be a completion for M if C is not contained in M but every proper subalgebra of C that is an ideal of L is contained in M. The set I(M) of all completions of…

We obtain the symmetry algebra of multi-matrix models in the planar large N limit. We use this algebra to associate these matrix models with quantum spin chains. In particular, certain multi-matrix models are exactly solved by using known…

If a string is cyclically shifted it will re-appear after a certain number of shifts, which will be called its order. We solve the problem of how many strings exist with a given order. This problem arises in the context of quantum mechanics…

We generalize the existence of maximal orders in a semi-simple algebra for general ground rings. We also improve several statements in Chapter 5 and 6 of Reiner's book concerning separable algebras by removing the separability condition,…

We study finite automata running over infinite binary trees. A run of such an automaton is usually said to be accepting if all its branches are accepting. In this article, we relax the notion of accepting run by allowing a certain quantity…

Refining a constructive combinatorial method due to MacLane and Schilling, we give several criteria for a valued field that guarantee that all of its maximal immediate extensions have infinite transcendence degree. If the value group of the…

A supercongruence is a congruence between rational numbers modulo a power of a prime. In this paper, we give a technique for finding and algorithmically proving supercongruences by expressing terms as infinite series involving certain…

The elaboration of new quantization methods has recently developed the interest in the study of subalgebras of the Lie algebra of polynomial vector fields over a Euclidean space. In this framework, these subalgebras define maximal…

We consider two questions in string ``phenomenology.'' First, are there any generic string predictions? Second, are there any general lessons which string theory suggests for thinking about low energy models, particularly in the framework…

This is a broad-brush review of how string theory addresses several important questions of gravitational physics. The problem of non-renormalizability is first reviewed, followed by introduction of string theory as an ultraviolet-finite…

Supergravity provides the effective field theories for string compactifications. The deformation of the maximal supergravities by non-abelian gauge interactions is only possible for a restricted class of charges. Generically these…

In this paper, we investigate a problem concerning quartets, which are a particular type of tree on four leaves. Loosely speaking, a set of quartets is said to be `definitive' if it completely encapsulates the structure of some larger tree,…

An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…

The recently introduced \emph{Degree Preserving Growth} model (Nature Physics, \DOI{10.1038/s41567-021-01417-7}) uses matchings to insert new vertices of prescribed degrees into the current graph of an ever-growing graph sequence. The…

One of the major open problems in automata and logic is the following: is there an algorithm which inputs a regular tree language and decides if the language can be defined in first-order logic? The goal of this paper is to present this…

We address the problem of when two finite dimensional central division algebras over the same field are necessarily isomorphic given that they have the same maximal subfields.