Related papers: Minimal length maximal green sequences
In this paper, we study the distribution of the genuses of cluster quivers of finite mutation type. First, we prove that in the $11$ exceptional cases, the distribution of genuses is $0$ or $1$. Next, we consider the relationship between…
The distributions of the $m$-th longest runs of multivariate random sequences are considered. For random sequences made up of $k$ kinds of letters, the lengths of the runs are sorted in two ways to give two definitions of run length…
A q-ary linear code of dimension k is called a maximum weight spectrum (MWS) code if it has the maximum possible number (viz. (q^k-1)/(q-1)) of different non-zero weights. We construct MWS codes from quasi-minimal codes, thus obtaining of…
Minimal linear codes are in one-to-one correspondence with special types of blocking sets of projective spaces over a finite field, which are called strong or cutting blocking sets. In this paper we prove an upper bound on the minimal…
The degree sequence optimization problem is to find a subgraph of a given graph which maximizes the sum of given functions evaluated at the subgraph degrees. Here we study this problem by replacing degree sequences, via suitable nonlinear…
Multiple sequence alignment (MSA) has been one of the most important problems in bioinformatics for more decades and it is still heavily examined by many mathematicians and biologists. However, mostly because of the practical motivation of…
A turn sequence of left and right turns is realized as a simple rectilinear chain of integral segments whose turns at its bends are the same as the turn sequence. The chain starts from the origin and ends at some point which we call a…
Minimal spanning trees on infinite vertex sets are investigated. A criterion for minimality of a spanning tree having a finite length is obtained, which generalizes the corresponding classical result for finite sets. It is given an analytic…
A linear arrangement is a mapping $\pi$ from the $n$ vertices of a graph $G$ to $n$ distinct consecutive integers. Linear arrangements can be represented by drawing the vertices along a horizontal line and drawing the edges as semicircles…
In this paper we develop combinatorial techniques for the case of string algebras with the aim to give a characterization of string complexes with infinite minimal projective resolution. These complexes will be called \textit{periodic…
We define a notion of higher order renormalization group equation and investigate when a sequence of trees satisfies such an equation. In the strongest sense, the sequence of trees satisfies a $k$th order renormalization group equation when…
The attempts to prove the Four Color Problem last for long years. A little hope arises that the properties of the minimal partial triangulations will be very useful for the solution of the Four Color Problem. That is why the material of…
In extension theory, in particular in dimension theory, it is frequently useful to represent a given compact metrizable space X as the limit of an inverse sequence of compact polyhedra. We are going to show that, for the purposes of…
In this paper, we define the linear complexity for multidimensional sequences over finite fields, generalizing the one-dimensional case. We give some lower and upper bounds, valid with large probability, for the linear complexity and…
Linear singularly perturbed convection-diffusion problems with characteristic layers are considered in three dimensions. We demonstrate the sharpness of our recently obtained upper bounds for the associated Green's function and its…
When considering the number of subtrees of trees, the extremal structures which maximize this number among binary trees and trees with a given maximum degree lead to some interesting facts that correlate to other graphical indices in…
The application of the max-algebra to describe queueing systems by both linear scalar and vector equations is discussed. It is shown that these equations may be handled using ordinary algebraic manipulations. Examples of solving the…
We introduce the notion of composition series of triangulated categories, which generalizes full exceptional sequences. The lengths of composition series yield invariants for triangulated categories. We study composition series of derived…
We describe the "generic" part of the character ring of general linear groups over a finite field in terms of quiver representations.
Minimal Strong Digraphs (MSDs) can be regarded as a generalization of the concept of tree to directed graphs. Their cyclic structure and some spectral properties have been studied in several articles. In this work, we further study some…