相关论文: Maximal green sequences for string algebras

The maximal subalgebras of the finite dimensional simple special Jordan superalgebras over an algebraically closed field of characteristic 0 are studied. This is a continuation of a previous paper by the same authors about maximal…

Finite automata with weights in the max-plus semiring are considered. The main result is: it is decidable in an effective way whether a series that is recognized by a finitely ambiguous max-plus automaton is unambiguous, or is sequential. A…

We study acts and modules of maximal growth over finitely generated free monoids and free associative algebras as well as free groups and free group algebras. The maximality of the growth implies some other specific properties of these acts…

We discuss different formulations and approaches to string theory and $ 2d$ quantum gravity. The generic idea to get a unique description of {\it many} different string vacua altogether is demonstrated on the examples in $ 2d$ conformal,…

The key open problem of string theory remains its non-perturbative completion to M-theory. A decisive hint to its inner workings comes from numerous appearances of higher structures in the limits of M-theory that are already understood,…

With our current level of understanding, the problem of making string theory predictions is not one of "solving" the theory, but rather of trying to determine whether there are any generic expectations. Within this context, we discuss what…

We classify the trees on $n$ vertices with the maximum and the minimum number of certain generalized colorings, including conflict-free, odd, non-monochromatic, star, and star rainbow vertex colorings. We also extend a result of Cutler and…

We consider classes of graphs, which we call thick graphs, that have the vertices of a corresponding thin graph replaced by cliques and the edges replaced by cobipartite graphs In particular, we consider the case of thick forests, which we…

We consider the problem of finding a subgraph of a given graph which maximizes a given function evaluated at its degree sequence. While the problem is intractable already for convex functions, we show that it can be solved in polynomial…

As of today there exist consistent, gauge-invariant string field theories describing all string theories: bosonic open and closed strings, open superstrings, heterotic strings and type II strings. The construction of these theories require…

We obtain a complete classification of complex-valued sequences which are both multiplicative and automatic.

A subset $M$ of the edge set of a graph $G$ is an induced matching of $G$ if given any two $e_1,e_2 \in M$, none of the vertices on $e_1$ is adjacent to any of the vertices on $e_2$. Suppose that $MIM_G$, a positive integer, is the largest…

We present a critical review and summary of String Gas Cosmology. We include a pedagogical derivation of the effective action starting from string theory, emphasizing the necessary approximations that must be invoked. Working in the…

String vertices of open-closed string field theory on an arbitrary closed string background with $N$ identical D-branes are investigated when $N$ is large. We identify the relevant geometric master equation and solve it using open-closed…

Motivated by the theory of graph limits, we introduce and study the convergence and limits of linear representations of finite groups over finite fields. The limit objects are infinite dimensional representations of free groups in…

We generalise various theorems for finding indiscernible trees and arrays to positive logic: based on an existing modelling theorem for s-trees, we prove modelling theorems for str-trees, str$_0$-trees (the reduct of str-trees that forgets…

Decision trees have been a very popular class of predictive models for decades due to their interpretability and good performance on categorical features. However, they are not always robust and tend to overfit the data. Additionally, if…

The computation of a maximal order of an order in a semisimple algebra over a global field is a classical well-studied problem in algorithmic number theory. In this paper we consider the related problems of computing all minimal overorders…

The Markov Chain Tree Theorem is extended to the max algebra and possible applications to ranking problems are discussed.

Tangle-tree theorems are an important tool in structural graph theory, and abstract separation systems are a very general setting in which tangle-tree theorems can still be formulated and proven. For infinite abstract separation systems, so…