Related papers: A Geodesic Stratification of Two-dimensional Semi-…

When applying automatic analysis of fluorescence or histopathological images of cells, it is necessary to partition, or de-clump, partially overlapping cell nuclei. In this work, I describe a method of partitioning partially overlapping…

The aim of this article is to provide space level maps between configuration spaces of graphs that are predicted by algebraic manipulations of cellular chains. More explicitly, we consider edge contraction and half-edge deletion, and…

The stratified structure of the configuration space $\mb G^N = G \times ... \times G$ reduced with respect to the action of $G$ by inner automorphisms is investigated for $G = SU(3) .$ This is a finite dimensional model coming from lattice…

We give a survey of recent results related to the problem of characterizing finite-dimensional division algebras by the set of isomorphism classes of their maximal subfields. We also discuss various generalizations of this problem and some…

Let Y be a complex algebraic curve and let [Y]={X_1,...,X_n} be the set of all real algebraic curves X_i with complexification X_i(C)=Y, such that the real points X_i(R) divide X_i(C). We find all such families [Y]. According to Harnak…

Consider a Leibniz superalgebra $\mathfrak L$ additionally graded by an arbitrary set $I$ (set grading). We show that $\mathfrak L$ decomposes as the sum of well-described graded ideals plus (maybe) a suitable linear subspace. In the case…

Let $\Gamma$ denote a finite, undirected, connected graph, with vertex set $X$. Fix a vertex $x \in X$. Associated with $x$ is a certain subalgebra $T=T(x)$ of ${\rm Mat}_X(\mathbb C)$, called the subconstituent algebra. The algebra $T$ is…

We present a study of semigroup compactifications of a semitopological semigroup $S$ using certain filters on $S$. We characterize closed subsemigroups and closed left, right, and two-sided ideals in any semigroup compactification of any…

A constructive method for decomposing finite dimensional representations of semisimple real Lie algebras is developed. The method is illustrated by an example. We also discuss an implementation of the algorithm in the language of the…

This note discusses some geometrically defined seminorms on the group $\Ham(M, \omega)$ of Hamiltonian diffeomorphisms of a closed symplectic manifold $(M, \omega)$, giving conditions under which they are nondegenerate and explaining their…

Let $F$ be a lower semicontinuous, 1-homogeneous positive function defined on $\mathbf{R}^n$. We provide a characterization of absolutely continuous paths that minimize the anisotropic $F$-length between two points. The characterization is…

In this article we investigate the lattices of Dyck paths of type $A$ and $B$ under dominance order, and explicitly describe their Heyting algebra structure. This means that each Dyck path of either type has a relative pseudocomplement with…

Let K be an algebraically closed field of characteristic zero, endowed with a complete nonarchimedean norm. Let X be a K-rigid analytic variety and \Sigma a semianalytic subset of X. Then the closure of \Sigma in X with respect to the…

For an arbitrary partially ordered set $P$ its {\em dual} $P^*$ is built as the collection of all monotone mappings $P\to\2$ where $\2=\{0,1\}$ with $0<1$. The set of mappings $P^*$ is proved to be a complete lattice with respect to the…

Partial duality generalizes the fundamental concept of the geometric dual of an embedded graph. A partial dual is obtained by forming the geometric dual with respect to only a subset of edges. While geometric duality preserves the genus of…

A (Hasse) diagram of a finite partially ordered set (poset) P will be called quasiplanar if for any two incomparable elements u and v, either v is on the left of all maximal chains containing u, or v is on the right of all these chains.…

Slimness of a graph measures the local deviation of its metric from a tree metric. In a graph $G=(V,E)$, a geodesic triangle $\bigtriangleup(x,y,z)$ with $x, y, z\in V$ is the union $P(x,y) \cup P(x,z) \cup P(y,z)$ of three shortest paths…

The reassembling of a simple connected graph G = (V,E) is an abstraction of a problem arising in earlier studies of network analysis. Its simplest formulation is in two steps: (1) We cut every edge of G into two halves, thus obtaining a…

In this article we study homotopes of finite-dimensional algebras (not necessarily, associative). In the case of associative algebras we study homotopes by methods of Category theory and give description of so-called well-tempered elements…

This paper deals with stratifying systems over hereditary algebras. In the case of tame hereditary algebras we obtain a bound for the size of the stratifying systems composed only by regular modules and we conclude that stratifying systems…