Related papers: Subspaces, subsets, and Motzkin paths

We discuss two categorical characterizations of the class of acyclic maps between (path-connected) spaces. The first one is in terms of the higher categorical notion of an epimorphism. The second one employs the notion of a balanced map,…

Given two points on a soup can or conical cup with lid, we find and classify all paths of minimal length connecting them. When the number of minimal paths is finite, there are at most four on a can and three on a cup. At worst, minimal…

Using equivariant obstruction theory we construct equivariant maps from certain classifying spaces to representation spheres for cyclic groups, product of elementary Abelian groups and dihedral groups. Restricting them to finite skeleta…

The set of matrix tuples with invariant subspaces whose dimensions sum up to the dimension of the space, but which do not span the whole space form an algebraic hypersurface. We found the equation of this hypersurface. This generalizes…

The space of directions is a notion of boundary associated to an arbitrary totally disconnected locally compact group. We explicitly calculate the space of directions of a group acting vertex transitively with compact open vertex…

Using Gutzmer's formula, due to Lassalle, we characterise the image of Sobolev spaces under the Segal-Bargmann transform on compact Riemannian symmetric spaces.

Let $M$ be any $n$ dimensional smooth manifold and $PM$ be the space of all smooth paths, then we showed that $PM$ is a smooth manifold modelled over a complete normable space. We discussed many geometric structure on Path spaces and its…

We present two models for the space of knots which have endpoints at fixed boundary points in a manifold with boundary, one model defined as an inverse limit of spaces of maps between configuration spaces and another which is cosimplicial.…

We give two equivalent sets of invariants which classify pairs of coisotropic subspaces of a finite-dimensional symplectic vector space. We identify five elementary types of coisotropic pairs and show that any coisotropic pair decomposes in…

Cocompactness is a useful weaker counterpart of compactness in the study of imbeddings between function spaces. In this paper we show that subcritical continuous imbeddings of fractional Sobolev spaces and Besov spaces over \mathbb{R}^{N}…

We provide an alternative view of some results in [1, 3, 11]. In particular, we prove that (1) if a continuous self-map of a compact metric space has the shadowing, then the union of the basins of terminal chain components is a dense…

In this note, we find a sharp bound for the minimal number (or in general, indexing set) of subspaces of a fixed (finite) codimension needed to cover any vector space V over any field. If V is a finite set, this is related to the problem of…

We consider an ``integral'' extension of the classical notion of affine connection providing a correspondence between paths in the manifold and diffeomorphisms of the manifold. These path-diffeomorphisms are a generalization of parallel…

Path sets are spaces of one-sided infinite symbol sequences corresponding to the one-sided infinite walks beginning at a fixed initial vertex in a directed labeled graph. Path sets are a generalization of one-sided sofic shifts. This paper…

The combinatorial description via ribbon graphs of the moduli space of Riemann surfaces makes it possible to define combinatorial cycles in a natural way. Witten and Kontsevich first conjectured that these classes are polynomials in the…

In this survey article we provide an introduction to submanifold geometry in symmetric spaces of noncompact type. We focus on the construction of examples and the classification problems of homogeneous and isoparametric hypersurfaces, polar…

The (parallel) linear transports along paths in vector bundles are axiomatically described. Their general form and certain properties are found. It is shown that these transports are locally (i.e. along every fixed path) always Euclidean…

We introduce the minor-closed, dual-closed class of multi-path matroids. We give a polynomial-time algorithm for computing the Tutte polynomial of a multi-path matroid, we describe their basis activities, and we prove some basic structural…

The Tamari lattice, defined on Catalan objects such as binary trees and Dyck paths, is a well-studied poset in combinatorics. It is thus natural to try to extend it to other families of lattice paths. In this article, we fathom such a…

A subcycle of an Eulerian circuit is a sequence of edges that are consecutive in the circuit and form a cycle. We characterise the quartic planar graphs that admit Eulerian circuits avoiding 3-cycles and 4-cycles. From this, it follows that…