Related papers: Some remarks about trunks and morphisms of neural …
Any rational map between affine spaces, projective spaces or toric varieties can be described in terms of their affine, homogeneous, or Cox coordinates. We show an analogous statement in the setting of Mori Dream Spaces. More precisely (in…
Lov\'asz (1967) showed that two graphs $G$ and $H$ are isomorphic if, and only if, they are homomorphism indistinguishable over all graphs, i.e., $G$ and $H$ admit the same number of number of homomorphisms from every graph $F$.…
We solved the long-standing problem of describing the cohomology ring of semiample hypersurfaces in complete simplicial toric varieties. Also, the monomial-divisor mirror map is generalized to a map between the whole Picard group and the…
Goresky, Kottwitz and MacPherson have recently shown that the computation of the equivariant cohomology ring of a G-manifold can be reduced to a computation in graph theory. This opens up the possibility that many of the fundamental…
In this paper we will discuss isometries and strong isometries for convolutional codes. Isometries are weight-preserving module isomorphisms whereas strong isometries are, in addition, degree-preserving. Special cases of these maps are…
In the first part of the paper we construct a ring structure on the rational cobordism classes of Morin maps (i. e. smooth generic maps of corank 1). We show that associating to a Morin map its singular strata defines a ring homomorphism to…
In this paper, we extend the recently introduced concept of partially dual ribbon graphs to graphs. We then go on to characterize partial duality of graphs in terms of bijections between edge sets of corresponding graphs. This result…
The structure of multivariate semisimple codes over a finite chain ring $R$ is established using the structure of the residue field $\bar R$. Multivariate codes extend in a natural way the univariate cyclic and negacyclic codes and include…
This is a chapter of the upcoming "A Concise Encyclopedia of Coding Theory", W.C. Huffman, J.-L. Kim, and P. Sole' Eds., CRC Press. The chapter gives an introduction to the mathematical theory of rank-metric codes. Treated topics include:…
Neural networks are often represented as graphs of connections between neurons. However, despite their wide use, there is currently little understanding of the relationship between the graph structure of the neural network and its…
The spatial structure of the axonal and dendritic arborizations is closely related to the functionality of specific neurons or neuronal subsystems. The present work describes how multiscale Minkowski functionals can be used in order to…
It is shown that a surjective monotone map $X\to Y$ between finite $T_0$-spaces induces a surjective map on homology. As such a map turns out to be a sequence of edge contractions in the Hasse diagram of $X$, followed by a homeomorphism,…
Let $R$ be a commutative ring with identity. We define a graph $\Gamma_{\aut}(R)$ on $ R$, with vertices elements of $R$, such that any two distinct vertices $x, y$ are adjacent if and only if there exists $\sigma \in \aut$ such that…
A multicomplex structure is defined from an ordered lattice of multigraphs. This structure will help us to observe the features of Persistent Homology in this context, its interaction with the ordering and the repercussions of the process…
This thesis investigates the central role of homomorphism problems (structure-preserving maps) in two complementary domains: database querying over finite, graph-shaped data, and constraint solving over (potentially infinite) structures.…
We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…
Given a morphism $F : X \rightarrow Y$ from a Mori Dream Space $X$ to a smooth Mori Dream Space $Y$ and quasicoherent sheaves $\mathcal{F}$ on $X$ and $\mathcal{G}$ on $Y$ , we describe the inverse image of $\mathcal{G}$ by $F$ and the…
We introduce graphcodes, a novel multi-scale summary of the topological properties of a dataset that is based on the well-established theory of persistent homology. Graphcodes handle datasets that are filtered along two real-valued scale…
Trellises are crucial graphical representations of codes. While conventional trellises are well understood, the general theory of (tail-biting) trellises is still under development. Iterative decoding concretely motivates such theory. In…
Given a map $f: X\rightarrow Y$ of simply connected spaces of finite type such. The space of based loops at $f$ of the space of maps between $X$ and $Y$ is denoted by $\Omega_{f} Map(X,Y)$. For $n> 0$, we give a model categorical…