相关论文: A One-Step Cascade Symmetric Model: Rank-$1$ Packe…

We introduce a refinement of the persistence diagram, the graded persistence diagram. It is the Mobius inversion of the graded rank function, which is obtained from the rank function using the unary numeral system. Both persistence diagrams…

In this paper we are interested in a version of the All-pairs Shortest Paths problem (APSP) that fits neither in the exact nor in the approximate case. We define a measure of centrality of a shortest path, related to the ``importance'' of…

In the context of state-space models, skeleton-based smoothing algorithms rely on a backward sampling step which by default has a $\mathcal O(N^2)$ complexity (where $N$ is the number of particles). Existing improvements in the literature…

We show that in crystalline insulators point group symmetry alone gives rise to a topological classification based on the quantization of electric polarization. Using C3 rotational symmetry as an example, we first prove that the…

A Datalog program solves a constraint satisfaction problem (CSP) if and only if it derives the goal predicate precisely on the unsatisfiable instances of the CSP. There are three Datalog fragments that are particularly important for…

We propose an extension of the totally asymmetric simple exclusion process (TASEP) in which particles hopping along a lattice can be blocked by obstacles that dynamically attach/detach from lattice sites. The model can be thought as TASEP…

For a class of integral operators with kernels metric functions on manifold we find some necessary and sufficient conditions to have finite rank. The problem we pose has a stochastic nature and boils down to the following alternative…

We provide a rigorous numerical computation method to validate periodic, homoclinic and heteroclinic orbits as the continuation of singular limit orbits for the fast-slow system $x' = f(x,y,\epsilon), y' = \epsilon g(x,y,\epsilon)$ with…

We consider the integrable family of symmetric boundary-driven interacting particle systems that arise from the non-compact XXX Heisenberg model in one dimension with open boundaries. In contrast to the well-known symmetric exclusion…

Most of the existing works on provable guarantees for low-rank matrix completion algorithms rely on some unrealistic assumptions such that matrix entries are sampled randomly or the sampling pattern has a specific structure. In this work,…

A characteristic property of cohomology with compact support is the long exact sequence that connects the compactly supported cohomology groups of a space, an open subspace and its complement. Given an arbitrary cohomology theory of…

We consider the problem of optimizing the locations of source nodes in transportation networks. A reduction of the fraction of surplus nodes induces a glassy transition. In contrast to most constraint satisfaction problems involving…

Persistent homology is a popular and useful tool for analysing finite metric spaces, revealing features that can be used to distinguish sets of unlabeled points and as input into machine learning pipelines. The famous stability theorem of…

We study the asymmetric exclusion process on a regular Cayley tree with arbitrary co-ordination number. In this model particles can enter the system only at the parent site and exit from one of the sites at the last level. In the bulk they…

In this paper, we give the sharp estimates for the degree of symmetry and the semi-simple degree of symmetry of certain four dimensional fiber bundles by virtue of the rigidity theorem of harmonic maps due to Schoen and Yau. As a corollary…

The regular polyhedra have the highest order of 3D symmetries and are exceptionally at- tractive templates for (self)-assembly using minimal types of building blocks, from nano-cages and virus capsids to large scale constructions like glass…

In this work, we unify recent variable-clustering techniques within a common geometric framework which allows to extend clustering to variable-structures, i.e. variable-subsets within which links between variables are taken into…

We study a variant of the Coordinated Motion Planning problem on undirected graphs, referred to herein as the \textsc{Coordinated Sliding-Motion Planning} (CSMP) problem. In this variant, we are given an undirected graph $G$, $k$ robots…

We define and study a statistical mechanics ensemble that characterizes connected solutions in constraint satisfaction problems (CSPs). Built around a well-known local entropy bias, it allows us to better identify hardness transitions in…

We give a sufficient criterion, which we call stability, for a coarse Lipschitz map $f$ from a complete manifold $X$ with Ricci curvature bounded below to a proper Hadamard space $Y$ to be within bounded distance of a harmonic map. We prove…