Related papers: Barcode Posets: Combinatorial Properties and Conne…
We define the crossing graph of a given embedded graph (such as a road network) to be a graph with a vertex for each edge of the embedding, with two crossing graph vertices adjacent when the corresponding two edges of the embedding cross…
A harmonic mapping is a univalent harmonic function of one complex variable. We define a family of harmonic mappings on the unit disk whose images are rotationally symmetric rosettes with $n$ cusps or n nodes, where $n \ge 3$. These…
Persistence modules and barcodes are used in symplectic topology to define various invariants of Hamiltonian diffeomorphisms, however numerical methods for computing these barcodes are not yet well developed. In this paper we define one…
A Hadamard-Hitchcock decomposition of a multidimensional array is a decomposition that expresses the latter as a Hadamard product of several tensor rank decompositions. Such decompositions can encode probability distributions that arise…
In this paper, we provide a unified definition of mediated graph, a combinatorial structure with multiple applications in mathematical optimization. We study some geometric and algebraic properties of this family of graphs and analyze…
A preferential arrangement of a set is a total ordering of the elements of that set with ties allowed. A barred preferential arrangement is one in which the tied blocks of elements are ordered not only amongst themselves but also with…
A binary $[n,k]$-linear code $\mathcal{C}$ is a $k$-dimensional subspace of $\mathbb{F}_2^n$. For $\boldsymbol{x}\in \mathbb{F}_2^n$, the set $\boldsymbol{x}+\mathcal{C}$ is a coset of $\mathcal{C}$. In this work we study a partial ordering…
We investigate linear and additive codes in partially ordered Hamming-like spaces that satisfy the extension property, meaning that automorphisms of ideals extend to automorphisms of the poset. The codes are naturally described in terms of…
When one inserts a number of identical bars in between blocks of an ordered set partition, they get a barred preferential arrangement. In this study we define a new generalization of barred preferential arrangements, by considering barred…
A position coding pattern is an array of symbols in which subarrays of a certain fixed size appear at most once. So, each subarray uniquely identifies a location in the larger array, which means there is a bijection of some sort from this…
This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…
S.Janson [Poset limits and exchangeable random posets, Combinatorica 31 (2011), 529--563] defined limits of finite posets in parallel to the emerging theory of limits of dense graphs. We prove that each poset limit can be represented as a…
We consider the problems of finding optimal identifying codes, (open) locating-dominating sets and resolving sets (denoted IDENTIFYING CODE, (OPEN) LOCATING-DOMINATING SET and METRIC DIMENSION) of an interval or a permutation graph. In…
In this article, the main goal is to give a dynamical point of view of Floer homology barcodes for Hamiltonian homeomorphisms of surfaces. More specifically, we describe a way to construct barcodes for Hamiltonian homeomorphisms of surfaces…
Lattice and special nonlattice multilevel constellations constructed from binary codes, such as Constructions A, C, and D, have relevant applications in Mathematics (sphere packing) and in Communication (multi-stage decoding and efficient…
We develop a general framework for the probabilistic analysis of random finite point clouds in the context of topological data analysis. We extend the notion of a barcode of a finite point cloud to compact metric spaces. Such a barcode…
We study a class of combinatorial objects that we call "decorated trees". These consist of vertices, arrows and edges, where each edge is decorated by two integers (one near each of its endpoints), each arrow is decorated by an integer, and…
A storage code is an assignment of symbols to the vertices of a connected graph $G(V,E)$ with the property that the value of each vertex is a function of the values of its neighbors, or more generally, of a certain neighborhood of the…
A unicellular map, or one-face map, is a graph embedded in an orientable surface such that its complement is a topological disk. In this paper, we give a new viewpoint to the structure of these objects, by describing a decomposition of any…
We give a combinatorial classification for the class of postcritically fixed Newton maps of polynomials and indicate potential for extensions. As our main tool, we show that for a large class of Newton maps that includes all hyperbolic…