相关论文: Embedding $FD(\omega)$ into $\mathcal{P}_s$ densel…

Brown and Colbourn (1992) showed that the complex roots of the reliability polynomial of connected multigraphs are dense in the unit disk and that the closure of the real roots is $[-1,0] \cup \{1\}$. We prove the simple graph analogues of…

Numerical studies of the reduced density matrix of a gapped spin-1/2 Heisenberg antiferromagnet on a two-leg ladder find that it has the same form as the Gibbs density matrix of a gapless spin-1/2 Heisenberg antiferromagnetic chain at a…

Green, Tao and Ziegler prove ``Dense Model Theorems'' of the following form: if R is a (possibly very sparse) pseudorandom subset of set X, and D is a dense subset of R, then D may be modeled by a set M whose density inside X is…

A distributive lattice structure ${\mathbf M}(G)$ has been established on the set of perfect matchings of a plane bipartite graph $G$. We call a lattice {\em matchable distributive lattice} (simply MDL) if it is isomorphic to such a…

Given a graph $G$, a subset $S$ of vertices of $G$ is an efficient dominating set ($EDS$) if $|N[v] \cap S|=1,$ for all $v\in V(G)$. A graph $G$ is efficiently dominatable if it possesses an $EDS$. The efficient domination number of G is…

An off-lattice Monte Carlo algorithm for solutions of equilibrium polymers (EP) is proposed. At low and moderate densities this is shown to reproduce faithfully the (static) properties found recently for flexible linear EP using a lattice…

Let $E, F\subset \R^d$ be two self-similar sets. Under mild conditions, we show that $F$ can be $C^1$-embedded into $E$ if and only if it can be affinely embedded into $E$; furthermore if $F$ can not be affinely embedded into $E$, then the…

We partly extend the localisation technique from convex geometry to the multiple constraints setting. For a given $1$-Lipschitz map $u\colon\mathbb{R}^n\to\mathbb{R}^m$, $m\leq n$, we define and prove the existence of a partition of…

Limits of densities belonging to an exponential family appear in many applications, {e.g.} Gibbs models in Statistical Physics, relaxed combinatorial optimization, coding theory, critical likelihood computations, Bayes priors with singular…

We develop a new algorithm for factoring a bivariate polynomial $F\in \mathbb{K}[x,y]$ which takes fully advantage of the geometry of the Newton polygon of $F$. Under a non degeneracy hypothesis, the complexity is…

The central charge of the dimer model on the square lattice is still being debated in the literature. In this paper, we provide evidence supporting the consistency of a $c=-2$ description. Using Lieb's transfer matrix and its description in…

An $\omega_1$-compact space is a space in which every closed discrete subspace is countable. We give various general conditions under which a locally compact, $\omega_1$-compact space is $\sigma$-countably compact, i.e., the union of…

We provide a new degree bound on the weighted sum-of-squares (SOS) polynomials for Putinar-Vasilescu's Positivstellensatz. This leads to another Positivstellensatz saying that if $f$ is a polynomial of degree at most $2 d_f$ nonnegative on…

We prove that for every class of graphs $\mathcal{C}$ which is nowhere dense, as defined by Nesetril and Ossona de Mendez, and for every first order formula $\phi(\bar x,\bar y)$, whenever one draws a graph $G\in \mathcal{C}$ and a subset…

In this paper, we present some sufficient conditions on a metric space $M$ for which every molecule is a strongly subdifferentiable (SSD, for short) point in the Lipschitz-free space $\mathcal{F}(M)$ over $M$. Our main result reads as…

Erd\H{o}s and Hajnal conjectured that for every graph $H$, there exists $c>0$ such that every $H$-free graph $G$ has a clique or a stable set of size at least $|G|^c$ (a graph is $H$-free if it has no induced subgraph isomorphic to $H$).…

The role of fixed degrees of freedom in soft/granular matter systems has broad applicability and theoretical interest. Here we address questions of the geometrical role that a scaffolding of fixed particles plays in tuning the threshold…

We show that an arithmetic lattice $\Gamma$ in a semi-simple Lie group $G$ contains a torsion-free subgroup of index $\delta(v)$ where $v = \mu (G/\Gamma)$ is the co-volume of the lattice. We prove that $\delta$ is polynomial in general and…

We use weighted polynomial approximation to prove the existence of a compact set K with non-empty interior and a function f is dense in the space A(K) of all continuous functions on K that are holomorphic in the interior of K, endowed with…

An $n$-vertex graph $G$ is locally dense if every induced subgraph of size larger than $\zeta n$ has density at least $d > 0$, for some parameters $\zeta, d > 0$. We show that the number of induced subgraphs of $G$ with $m$ vertices and…