Related papers: A measure-theoretic approach to the theory of dens…
In this paper, we propose a novel hypergraph based method (called HF) to fit and segment multi-structural data. The proposed HF formulates the geometric model fitting problem as a hypergraph partition problem based on a novel hypergraph…
Laplace learning is a semi-supervised method, a solution for finding missing labels from a partially labeled dataset utilizing the geometry given by the unlabeled data points. The method minimizes a Dirichlet energy defined on a (discrete)…
The persistence diagram is a central object in the study of persistent homology and has also been investigated in the context of random topology. The more recent notion of the verbose diagram (a.k.a. verbose barcode) is a refinement of the…
The class of generic structures among those consisting of the measure algebra of a probability space equipped with an automorphism is axiomatizable by positive sentences interpreted using an approximate semantics. The separable generic…
The search for linguistic patterns, stylometry and forensic linguistics have in the theory of complex networks, their structures and associated mathematical tools, allies with which to model and analyze texts. In this paper we present a new…
We introduce merge-width, a family of graph parameters that unifies several structural graph measures, including treewidth, degeneracy, twin-width, clique-width, and generalized coloring numbers. Our parameters are based on new…
We address the problem of inferring self-supervised dense semantic correspondences between objects in multi-object scenes. The method introduces learning of class-aware dense object descriptors by providing either unsupervised discrete…
The Lov\'asz Local Lemma is a powerful probabilistic technique for proving the existence of combinatorial objects. It is especially useful for colouring graphs and hypergraphs with bounded maximum degree. This paper presents a general…
The inverse problem of diffraction theory in essence amounts to the reconstruction of the atomic positions of a solid from its diffraction image. From a mathematical perspective, this is a notoriously difficult problem, even in the…
This work initiates the systematic study of explicit distributions that are indistinguishable from a single exponential-size combinatorial object. In this we extend the work of Goldreich, Goldwasser and Nussboim (SICOMP 2010) that focused…
An oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label of $+1$ or $-1$. We define the adjacency, incidence and Laplacian matrices of an oriented hypergraph and study each of them. We extend several matrix…
Lecture notes as per the title. In the first part, the concepts of a measurable space, measurable maps between measurable spaces and that of a measure on a measurable space are introduced, after which the fundamentals of the theory of…
We construct a sequence of subset partition graphs satisfying the dimension reduction, adjacency, strong adjacency, and endpoint count properties whose diameter has a superlinear asymptotic lower bound. These abstractions of polytope graphs…
Network embedding has recently attracted lots of attentions in data mining. Existing network embedding methods mainly focus on networks with pairwise relationships. In real world, however, the relationships among data points could go beyond…
A homemorphism between domains in $\mathbb R^n$, $n\ge 2$ is quasiconformal, with its intricate analytic and geometric consequences, if the (pointwise) linear dilatation -- a purely metric quantity -- is uniformly bounded. Gehring proved…
For given Boolean algebras $\mathbb{A}$ and $\mathbb{B}$ we endow the space $\mathcal{H}(\mathbb{A},\mathbb{B})$ of all Boolean homomorphisms from $\mathbb{A}$ to $\mathbb{B}$ with various topologies and study convergence properties of…
In this paper we present a new width measure for a tree decomposition, minor-matching hypertree width, $\mu\text{-}tw$, for graphs and hypergraphs, such that bounding the width guarantees that set of maximal independent sets has a…
We introduce a persistent commutative algebra for studying the algebraic and combinatorial evolution of edge ideals of graphs and hypergraphs under filtration. Building on the Persistent Stanley--Reisner Theory (PSRT), we develop the notion…
In this note we observe that in the hyper-graph removal lemma the edge removal can be done in a way that the symmetries of the original hyper-graph remain preserved. As an application we prove the following generalization of Szemer\'edi's…
In this paper we establish a general form of the Mass Transference Principle for systems of linear forms conjectured in [1]. We also present a number of applications of this result to problems in Diophantine approximation. These include a…