相关论文: A Generalization of the {\L}o\'s-Tarski Preservati…
We exhibit how the Rasiowa-Sikorski Lemma simplifies, in a sense, proofs of results that make use of the technique known as back-and-forth, often resulting in not very illustrative arguments. The first two sections seek to show one simple…
We prove that every graph which admits a tree-decomposition into finite parts has a rooted tree-decomposition into finite parts that is linked, tight and componental. As an application, we obtain that every graph without half-grid minor has…
In this paper, we present some new results describing connections between the spectrum of a regular graph and its generalized connectivity, toughness, and the existence of spanning trees with bounded degree.
We introduce a generalization of conventional lattice gauge theory to describe fracton topological phases, which are characterized by immobile, point-like topological excitations, and sub-extensive topological degeneracy. We demonstrate a…
This is a survey of the proof of the global Jacquet-Langlands correspondence between GL_n and general inner forms, in characteristic zero. The proof is given after a long introduction recalling in some detail the objects and results…
The aim of this paper is to review how some approximation results in commutative algebra are being used to construct equisingular deformations of singularities. The first example of such an approximation result appeared for the first time…
The concept of bounded expansion provides a robust way to capture sparse graph classes with interesting algorithmic properties. Most notably, every problem definable in first-order logic can be solved in linear time on bounded expansion…
Tutte's spring embedding theorem states that, for a three-connected planar graph, if the outer face of the graph is fixed as the complement of some convex region in the plane, and all other vertices are placed at the mass center of their…
In this partly expository paper we discuss and describe some of our old and recent results on partial orders on the set (m,n)-graphs (i.e. graphs with n vertices and m edges) and some operations on graphs that are monotone with respect to…
We ask, when is a property of a model a logical property? According to the so-called Tarski-Sher criterion this is the case when the property is preserved by isomorphisms. We relate this to model-theoretic characteristics of abstract logics…
In the present article a new class $\Upsilon$ of all sets represented in the following form is introduced: $$ \mathbb S_{(s,u)}\equiv\left\{x: x= \Delta^{s}_{{\underbrace{u...u}_{\alpha_1-1}} \alpha_1{\underbrace{u...u}_{\alpha_2…
In this paper we study self-similar and fractal networks from the combinatorial perspective. We establish analogues of topological (Lebesgue) and fractal (Hausdorff) dimensions for graphs and demonstrate that they are naturally related to…
In this paper, we study uniform rooted plane trees with given degree sequence. We show, under some natural hypotheses on the degree sequence, that these trees converge toward the so-called Inhomogeneous Continuum Random Tree after…
We study the skew-symmetric prolongation of a Lie subalgebra $\g \subseteq \mathfrak{so}(n)$, in other words the intersection $\Lambda^3 \cap (\Lambda^1 \otimes \g)$.We compute this space in full generality. Applications include uniqueness…
We study derivations and Fredholm modules on metric spaces with a local regular conservative Dirichlet form. In particular, on finitely ramified fractals, we show that there is a non-trivial Fredholm module if and only if the fractal is not…
The Learnable Tree Filter presents a remarkable approach to model structure-preserving relations for semantic segmentation. Nevertheless, the intrinsic geometric constraint forces it to focus on the regions with close spatial distance,…
We investigate properties of closed approximate subgroups of locally compact groups, with a particular interest for approximate lattices i.e. those approximate subgroups that are discrete and have finite co-volume. We prove an approximate…
The purpose of this short paper is to further develop the theory of transverse generalized complex structures. We focus on proving some equivalent conditions to the basic $dd^{\mathcal{J}}$ -lemma. We justify our approach by describing the…
We show that if a subset $\Psi$ of the ends of a graph $G$ can be displayed by a tree-decomposition of finite adhesion, then it can also be displayed by a linked such tree-decomposition. This tree-decomposition captures all combinatorial…
In this paper we study detection and reconstruction of planted structures in Erd\H{o}s-R\'enyi random graphs. Motivated by a problem of communication security, we focus on planted structures that consist in a tree graph. For planted line…