Related papers: Delta-system method: a survey

Recent work on improving and revising estimates of solar activity [Clette et al., 2014] has resulted in renewed interest in what has been called the longest running 'Science Experiment'. We compare four reconstructions of solar activity as…

We present the first algorithm for computing class groups and unit groups of arbitrary number fields that provably runs in probabilistic subexponential time, assuming the Extended Riemann Hypothesis (ERH). Previous subexponential algorithms…

Our main result is a new upper bound for the size of k-uniform, L-intersecting families of sets, where L contains only positive integers. We characterize extremal families in this setting. Our proof is based on the Ray-Chaudhuri--Wilson…

We present the framework of delta-complete analysis for bounded reachability problems of general hybrid systems. We perform bounded reachability checking through solving delta-decision problems over the reals. The techniques take into…

The motions of the plasma and structures in and below the solar photosphere is not well understood. The results obtained using various methods cannot be in general considered as consistent, especially in details. In this contribution we…

There are many generalizations of the Erd\H{o}s-Ko-Rado theorem. We give new results (and problems) concerning families of $t$-intersecting $k$-element multisets of an $n$-set and point out connections to coding theory and classical…

Szemer\'edi's regularity lemma is a fundamental tool in extremal combinatorics. However, the original version is only helpful in studying dense graphs. In the 1990s, Kohayakawa and R\"odl proved an analogue of Szemer\'edi's regularity lemma…

We consider the problem of finding a large clique in an Erd\H{o}s--R\'enyi random graph where we are allowed unbounded computational time but can only query a limited number of edges. Recall that the largest clique in $G \sim G(n,1/2)$ has…

Detection of a planted dense subgraph in a random graph is a fundamental statistical and computational problem that has been extensively studied in recent years. We study a hypergraph version of the problem. Let $G^r(n,p)$ denote the…

A family $\mathcal{A}$ of sets is said to be \emph{$t$-intersecting} if any two sets in $\mathcal{A}$ have at least $t$ common elements. A central problem in extremal set theory is to determine the size or structure of a largest…

We say that a family $\mathcal F$ of $k$-element sets is a {\it $j$-junta} if there is a set $J$ of size $j$ such that, for any $F$, its presence in $\mathcal F$ depends on its intersection with $J$ only. Approximating arbitrary families by…

We consider the following generalization of the seminal Erd\H{o}s-Ko-Rado theorem, due to Frankl. For some k>=2, let F be a k-wise intersecting family of r-subsets of an n element set X, i.e. for any k sets F1,...,Fk in F, their…

A thermodynamic device placed outdoors, or a local ecosystem, is subject to a variety of different temperatures given by short-tem (daily) and long-term (seasonal) variations. In the long term a superstatistical description makes sense,…

A sunflower is a collection of distinct sets such that the intersection of any two of them is the same as the common intersection $C$ of all of them, and $|C|$ is smaller than each of the sets. A longstanding conjecture due to Erd\H{o}s and…

In 1984, Wilson proved the Erd\H{o}s-Ko-Rado theorem for $t$-intersecting families of $k$-subsets of an $n$-set: he showed that if $n\ge(t+1)(k-t+1)$ and $\mathcal{F}$ is a family of $k$-subsets of an $n$-set such that any two members of…

Sunspots are the most important indicator of the magnetic activity on the solar surface during a cycle. Every sunspot group is formed and shaped by the magnetic field of the Sun. Hence, the magnetic field intensity shows itself as the size…

The paper explores a new extremality model involving collections of arbitrary families of sets. We demonstrate its applicability to set-valued optimization problems with general preferences, weakening the assumptions of the known results…

Clustering is a fundamental machine learning task which has been widely studied in the literature. Classic clustering methods follow the assumption that data are represented as features in a vectorized form through various representation…

Let $D_n$ be the dihedral group with $2n$ elements, and suppose $n$ is greater than one. We call ring system a finite $D_n$-symmetric set of points in $\mathbb{R}^2$. Ring systems have been used as models for planets surrounded by rings,…

Erd\H{o}s and Pach (1983) introduced the natural degree-based generalisations of Ramsey numbers, where instead of seeking large monochromatic cliques in a $2$-edge coloured complete graph, we seek monochromatic subgraphs of high minimum or…