Related papers: A classification of small operators using graph th…

We introduce a classification of simple, regular, closed symmetric operators with deficiency indices (1,1) according to a geometric criterion that extends the classical notions of entire operators and entire operators in the generalized…

Given a graph $G = (V,E)$ and a terminal $s\in V$, a cut $X$ for $s$ is a vertex set that contains $s$. We look for a cut that is small in two senses, i.e., there are no more than $k$ vertices in $X$ and no more than $t$ edges leaving $X$.…

We construct an index for BPS operators supported on a ray in five dimensional superconformal field theories with exceptional global symmetries. We compute the $E_n$ representations (for $n=2,\dots,7$) of operators of low spin, thus…

A catalogue of all non-isomorphic simple connected regular matroids ${\cal M}$ of cardinality $n \leq 15$ is provided on the net. These matroids are given as binary matrix matroids and are sieved from the large pool of all non-isomorphic…

Bidimensionality is the most common technique to design subexponential-time parameterized algorithms on special classes of graphs, particularly planar graphs. The core engine behind it is a combinatorial lemma of Robertson, Seymour and…

Let $E \ni x\mapsto A(x)$ be a $\mathscr{C}$-mapping with values unbounded normal operators with common domain of definition and compact resolvent. Here $\mathscr{C}$ stands for $C^\infty$, $C^\omega$ (real analytic), $C^{[M]}$…

For every $r \in \mathbb{N}$, let $\theta_r$ denote the graph with two vertices and $r$ parallel edges. The $\theta_r$-girth of a graph $G$ is the minimum number of edges of a subgraph of $G$ that can be contracted to $\theta_r$. This…

Rota-Baxter operators and more generally $\mathcal{O}$-operators on associative algebras are important in probability, combinatorics, associative Yang-Baxter equation and splitting of algebras. Using a method of Uchino, we construct an…

We consider bipartite graphs definable in o-minimal structures, in which the edge relation $G$ is a finite union of graphs of certain measure-preserving maps. We establish a fact on the existence of definable matchings with few short…

Matrix partition problems generalize a number of natural graph partition problems, and have been studied for several standard graph classes. We prove that each matrix partition problem has only finitely many minimal obstructions for split…

A graph G is distinguished if its vertices are labelled by a map \phi: V(G) \longrightarrow {1,2,...,k} so that no graph automorphism preserves \phi. The distinguishing number of G is the minimum number k necessary for \phi to distinguish…

We introduce a numerical radius operator space $(X, \mathcal{W}_n)$. The conditions to be a numerical radius operator space are weaker than the Ruan's axiom for an operator space $(X, \mathcal{O}_n)$. Let $w(\cdot)$ be the numerical radius…

For the almost Mathieu operator with a small coupling constant, for a series of spectral gaps, we describe the asymptotic locations of the gaps and get lower bounds for their lengths. The results are obtained by analysing a monodromy…

In this paper, our goal is to characterize two graph classes based on the properties of minimal vertex (edge) separators. We first present a structural characterization of graphs in which every minimal vertex separator is a stable set. We…

In this paper, we give definitions of three kinds of minimal charts, and we investigate properties of minimal charts and establish fundamental theorems characterizing minimal charts. To classify charts with two or three crossings we use the…

A graph H is a vertex-minor of a graph G if it can be reached from G by the successive application of local complementations and vertex deletions. Vertex-minors have been the subject of intense study in graph theory over the last decades…

The vertices of a graph are classified into seven types by J.T. Hedetniemi, S.M. Hedetniemi, S.T. Hedetniemi and T.M. Lewis and they ask the following questions: 1) What is the smallest order $n$ of a graph having $n-2$ very typical…

It was conjectured by Koh and Tay [Graphs Combin. 18(4) (2002), 745--756] that for $n\geq 5$ every simple graph of order $n$ and size at least $\binom{n}{2}-n+5$ has an orientation of diameter two. We prove this conjecture and hence…

Multicriteria Decision Making problems are important both for individuals and groups. Pairwise comparisons have become popular in the theory and practice of preference modelling and quantification. We focus on decision problems where the…

Graphlet analysis is an approach to network analysis that is particularly popular in bioinformatics. We show how to set up a system of linear equations that relate the orbit counts and can be used in an algorithm that is significantly…