Related papers: Maximal green sequences for string algebras
A proper subsemigroup of a semigroup is maximal if it is not contained in any other proper subsemigroup. A maximal subsemigroup of a finite semigroup has one of a small number of forms, as described in a paper of Graham, Graham, and Rhodes.…
We briefly review superstring theories, highlighting the important concepts, developments, and open problems of the subject.
In this paper, we study a maximization problem on real sequences. More precisely, for a given sequence, we are interested in computing the supremum of the sequence and an index for which the associated term is maximal. We propose a general…
String backgrounds are described as purely geometric objects related to moduli spaces of Riemann surfaces, in the spirit of Segal's definition of a conformal field theory. Relations with conformal field theory, topological field theory and…
The "No Gap Conjecture" of Br\"ustle-Dupont-P\'erotin states that the set of lengths of maximal green sequences for hereditary algebras over an algebraically closed field has no gaps. This follows from a stronger conjecture that any two…
Maximal green sequences are particular sequences of mutations which were introduced by Keller in the context of quantum dilogarithm identities and independently by Cecotti-Cordova-Vafa in the context of supersymmetric gauge theory. In this…
Patterns on numerical semigroups are multivariate linear polynomials, and they are said to be admissible if there exists a numerical semigroup such that evaluated at any nonincreasing sequence of elements of the semigroup gives integers…
Reflection and transmission of waves in piecewise constant layered media are important in various imaging modalities and have been studied extensively. Despite this, no exact time domain formulas for the Green's functions have been…
Over some types of trees with a given number of vertices, which trees minimize or maximize the total number of subtrees or leaf containing subtrees are studied. Here are some of the main results:\ (1)\, Sharp upper bound on the total number…
String matching algorithm plays the vital role in the Computational Biology. The functional and structural relationship of the biological sequence is determined by similarities on that sequence. For that, the researcher is supposed to aware…
The purpose of this paper is to consider when two maximal subalgebras of a finite-dimensional solvable Lie algebra $L$ are conjugate, and to investigate their intersection.
For each clone C on a set A there is an associated equivalence relation analogous to Green's R-relation, which relates two operations on A iff each one is a substitution instance of the other using operations from C. We study the clones for…
We discuss some types of congruences on Menger algebras of rank $n$, which are generalizations of the principal left and right congruences on semigroups. We also study congruences admitting various types of cancellations and describe their…
We summarize exact solutions of closed superstrings in a constant magnetic field, from a view point of the regularization criterion. Some models will be excluded according to this criterion. The spectrum-generating algebra is also…
We discuss the continuum field theory limit of the physical scenario described in Ref. [1], the universe arising from the interpretation of the most general collection of logical codes in terms of distributions of units of energy along…
Maximum-length sequences (m-sequences for short) over finite fields are generated by linear feedback shift registers with primitive characteristic polynomials. These sequences have nice mathematical structures and good randomness properties…
The aim of these lectures is to give an introduction to several topics which lie at the intersection of string theory, gravity theory and gravity phenomenology. One successively reviews: (i) the "membrane" approach to the dissipative…
Given an alphabet $S$, we consider the size of the subsets of the full sequence space $S^{\rm {\bf Z}}$ determined by the additional restriction that $x_i\not=x_{i+f(n)},\ i\in {\rm {\bf Z}},\ n\in {\rm {\bf N}}.$ Here $f$ is a positive,…
Main result: If a C*-algebra is simple, $\sigma$-unital, has finitely many extremal traces, and has strict comparison of positive elements by traces, then its multiplier also has strict comparison of positive elements by traces. The same…
We consider Dynkin algebras, these are the hereditary artin algebras of finite representation type. The indecomposable modules for a Dynkin algebra correspond bijectively to the positive roots of a Dynkin diagram. Given a Dynkin algebra…