相关论文: Delta-system method: a survey

The main result of this paper is a generalization of the classical blossom algorithm for finding perfect matchings. Our algorithm can efficiently solve Boolean CSPs where each variable appears in exactly two constraints (we call it edge…

We study discrete $\beta$-ensembles as introduced in [17]. We obtain rigidity estimates on the particle locations, i.e. with high probability, the particles are close to their classical locations with an optimal error estimate. We prove the…

We introduce a new group action on set systems, constructed as a semidirect product of a permutation group and a group generated by twist and loop complementation operations on a single element. This action extends the ribbon group…

In this first paper of a series we develop a new technique to analyze clusters of galaxies observed during the ROSAT All-Sky Survey (RASS). We call this method the Steepness Ratio Technique (SRT). The SRT uses the convolution between the…

Subsystem Density-Functional Theory (DFT) is an emerging technique for calculating the electronic structure of complex molecular and condensed phase systems. In this topical review, we focus on some recent advances in this field related to…

Nearly thirty years ago, Bar-Noy, Motwani and Naor [IPL'92] conjectured that an online $(1+o(1))\Delta$-edge-coloring algorithm exists for $n$-node graphs of maximum degree $\Delta=\omega(\log n)$. This conjecture remains open in general,…

We give the first polynomial-time, differentially node-private, and robust algorithm for estimating the edge density of Erd\H{o}s-R\'enyi random graphs and their generalization, inhomogeneous random graphs. We further prove…

In this paper we present the guidelines for an extrasolar planet taxonomy. The discovery of an increasing number of extrasolar planets showing a vast variety of planetary parameters, like Keplerian orbital elements and environmental…

Fix $t\in [1,\infty]$. Let $S$ be an atomic commutative semigroup and, for all $x\in S$, let $\mathscr{L}_t(S):=\{\|f\|_t:f\in Z(x)\}$ be the "$t$-length set" of $x$ (using the standard $l_p$-space definition of $\|\cdot\|_t$). The…

For a $k$-uniform hypergraph $F$ let $\textrm{ex}(n,F)$ be the maximum number of edges of a $k$-uniform $n$-vertex hypergraph $H$ which contains no copy of $F$. Determining or estimating $\textrm{ex}(n,F)$ is a classical and central problem…

Labeled Latent Dirichlet Allocation (LLDA) is an extension of the standard unsupervised Latent Dirichlet Allocation (LDA) algorithm, to address multi-label learning tasks. Previous work has shown it to perform in par with other…

It is still an open question how the Solar system is structured beyond 100 au from the Sun. Our understanding of this vast region remains very limited and only recently we have become aware of the existence there of a group of enigmatic…

Perfect secret sharing scheme is a method of distribute a secret information $s$ among participants such that only predefined coalitions, called qualified subsets of the participants can recover the secret, whereas any other coalitions, the…

The Strong Exponential Time Hypothesis (SETH) is a standard assumption in (fine-grained) parameterized complexity and many tight lower bounds are based on it. We consider a number of reasonable weakenings of the SETH, with sources from (i)…

We prove limit theorems of an entirely new type for certain long memory regularly varying stationary infinitely divisible random processes. These theorems involve multiple phase transitions governed by how long the memory is. Apart from one…

A cornerstone of extremal graph theory due to Erd\H{o}s and Stone states that the edge density which guarantees a fixed graph $F$ as subgraph also asymptotically guarantees a blow-up of $F$ as subgraph. It is natural to ask whether this…

This paper considers an extremal version of the Erd\H{o}s distinct distances problem. For a point set $P \subset \mathbb R^d$, let $\Delta(P)$ denote the set of all Euclidean distances determined by $P$. Our main result is the following: if…

The ring-diagram technique was developed by Frank Hill 25 years ago and developed quickly during the late 1990s. It is nowadays one of the most commonly used techniques in local helioseismology. The method consists in the power spectral…

For $\Delta \ge 5$ and $q$ large as a function of $\Delta$, we give a detailed picture of the phase transition of the random cluster model on random $\Delta$-regular graphs. In particular, we determine the limiting distribution of the…

An implicit Euler finite-volume scheme for general cross-diffusion systems with volume-filling constraints is proposed and analyzed. The diffusion matrix may be nonsymmetric and not positive semidefinite, but the diffusion system is assumed…