Related papers: Representative set statements for delta-matroids a…
Learning low-dimensional representations of single-cell transcriptomics has become instrumental to its downstream analysis. The state of the art is currently represented by neural network models such as variational autoencoders (VAEs) which…
Finding a new mathematical representations for graph, which allows direct comparison between different graph structures, is an open-ended research direction. Having such a representation is the first prerequisite for a variety of machine…
We show the existence of a polynomial-size extended formulation for the base polytope of a $(k,\ell)$-sparsity matroid. For an undirected graph $G=(V,E)$, the size of the formulation is $O(|V||E|)$ when $k \geq \ell$ and $O(|V|^2 |E|)$ when…
In this article we make several contributions of independent interest. First, we introduce the notion of stressed hyperplane of a matroid, essentially a type of cyclic flat that permits to transition from a given matroid into another with…
We present a new distributed representation in deep neural nets wherein the information is represented in native form as a matrix. This differs from current neural architectures that rely on vector representations. We consider matrices as…
This article addresses the Generalized Additive Decomposition (GAD) of symmetric tensors, that is, degree-$d$ forms $f \in \mathcal{S}_d$. From a geometric perspective, a GAD corresponds to representing a point on a secant of osculating…
Perturbed graphic matroids are binary matroids that can be obtained from a graphic matroid by adding a noise of small rank. More precisely, r-rank perturbed graphic matroid M is a binary matroid that can be represented in the form I +P,…
Let $\mathcal{P}_k(\delta)$, where $k$ is a positive integer and $\delta$ some complex parameter, be the classical partition algebra over the complex numbers. In the case when $\delta=n$, it is well-known that the algebra…
Graphs are a natural abstraction for many problems where nodes represent entities and edges represent a relationship across entities. An important area of research that has emerged over the last decade is the use of graphs as a vehicle for…
Morphisms of matroids are combinatorial abstractions of linear maps and graph homomorphisms. We introduce the notion of basis for morphisms of matroids, and show that its generating function is strongly log-concave. As a consequence, we…
It is proved that for each prime field $GF(p)$, there is an integer $f(p)$ such that a 4-connected matroid has at most $f(p)$ inequivalent representations over $GF(p)$. We also prove a stronger theorem that obtains the same conclusion for…
This thesis studies the representation theory and linear structures of $\mathcal{Q}$-manifolds and higher Lie algebroids. We introduce differential graded modules (or for short DG-modules) of $\mathcal{Q}$-manifolds and the equivalent…
We characterize the shifted simple graphs and the $3$-uniform shifted hypergraphs whose inverse image under exterior shifting is the set of bases of a matroid: those are exactly the hypergraphs whose hyperedges form an initial lex-segment.…
Given an $\Bbb{F}$-represented matroid $(M,\rho)$ with the ground set $[m]$, the representation $\rho$ naturally defines a hyperplane arrangement $\mathcal{A}_\rho$. We will study its parallel translates $\mathcal{A}_{\rho,{g}}$ of…
In this paper, we explore holomorphic Segre preserving maps. First, we investigate holomorphic Segre preserving maps sending the complexification $\mathcal{M}$ of a generic real analytic submanifold $M \subseteq \C^N$ of finite type at some…
Historical approaches to Table Representation Learning (TRL) have largely adopted the sequential paradigms of Natural Language Processing (NLP). We argue that this linearization of tables discards their essential geometric and relational…
We establish a connection between the algebraic geometry of the type B permutohedral toric variety and the combinatorics of delta-matroids. Using this connection, we compute the volume and lattice point counts of type B generalized…
By finding orthogonal representation for a family of simple connected called $\delta$-graphs it is possible to show that $\delta$-graphs satisfy delta conjecture. An extension of the argument to graphs of the form…
Spectral embedding is a procedure which can be used to obtain vector representations of the nodes of a graph. This paper proposes a generalisation of the latent position network model known as the random dot product graph, to allow…
Many important enumerative invariants of a matroid can be obtained from its Tutte polynomial, and many more are determined by two stronger invariants, the $\mathcal{G}$-invariant and the configuration of the matroid. We show that the same…