arXiv subjects

John Talbot

Publications and source records attributed to John Talbot.

27 records · Page 2Linked to original sources

arXiv2011

Combining asteroid models derived by lightcurve inversion with asteroidal occultation silhouettes

Asteroid sizes can be directly measured by observing occultations of stars by asteroids. When there are enough observations across the path of the shadow, the asteroid's projected silhouette can be reconstructed. Asteroid shape models derived from photometry by the lightcurve inversion method enable us to predict the orientation of an asteroid for the time of occultation. By scaling the shape model to fit the occultation chords, we can determine the asteroid size with a relative accuracy of typically ~ 10%. We combine shape and spin state models of 44 asteroids (14 of them are new or updated models) with the available occultation data to derive asteroid effective diameters. In many cases, occultations allow us to reject one of two possible pole solutions that were derived from photometry. We show that by combining results obtained from lightcurve inversion with occultation timings, we can obtain unique physical models of asteroids.

astro-ph.EP↗

arXiv2010

Hypergraphs do jump

We say that $α\in [0,1)$ is a jump for an integer $r\geq 2$ if there exists $c(α)>0$ such that for all $ε>0 $ and all $t\geq 1$ any $r$-graph with $n\geq n_0(α,ε,t)$ vertices and density at least $α+ε$ contains a subgraph on $t$ vertices of density at least $α+c$. The Erd\H os--Stone--Simonovits theorem implies that for $r=2$ every $α\in [0,1)$ is a jump. Erd\H os showed that for all $r\geq 3$, every $α\in [0,r!/r^r)$ is a jump. Moreover he made his famous "jumping constant conjecture" that for all $r\geq 3$, every $α\in [0,1)$ is a jump. Frankl and Rödl disproved this conjecture by giving a sequence of values of non-jumps for all $r\geq 3$. We use Razborov's flag algebra method to show that jumps exist for $r=3$ in the interval $[2/9,1)$. These are the first examples of jumps for any $r\geq 3$ in the interval $[r!/r^r,1)$. To be precise we show that for $r=3$ every $α\in [0.2299,0.2316)$ is a jump. We also give an improved upper bound for the Turán density of $K_4^-=\{123,124,134\}$: $π(K_4^-)\leq 0.2871$. This in turn implies that for $r=3$ every $α\in [0.2871,8/27)$ is a jump.

math.CO↗

arXiv2009

The minimal density of triangles in tripartite graphs

We determine the minimal density of triangles in a tripartite graph with prescribed edge densities. This extends a previous result of Bondy, Shen, Thomassé and Thomassen characterizing those edge densities guaranteeing the existence of a triangle in a tripartite graph. To be precise we show that a suitably weighted copy of the graph formed by deleting a certain 9-cycle from $K_{3,3,3}$ has minimal triangle density among all weighted tripartite graphs with prescribed edge densities.

math.CO↗

arXiv2009

Vertex Turán problems in the hypercube

Let $\mathcal{Q}_n$ be the $n$-dimensional hypercube: the graph with vertex set $\{0,1\}^n$ and edges between vertices that differ in exactly one coordinate. For $1\leq d\leq n$ and $F\subseteq \{0,1\}^d$ we say that $S\subseteq \{0,1\}^n$ is \emph{$F$-free} if every embedding $i:\{0,1\}^d\to \{0,1\}^n$ satisfies $i(F)\not\subseteq S$. We consider the question of how large $S\subseteq \{0,1\}^n$ can be if it is $F$-free. In particular we generalise the main prior result in this area, for $F=\{0,1\}^2$, due to E.A. Kostochka and prove a local stability result for the structure of near-extremal sets. We also show that the density required to guarantee an embedded copy of at least one of a family of forbidden configurations may be significantly lower than that required to ensure an embedded copy of any individual member of the family. Finally we show that any subset of the $n$-dimensional hypercube of positive density will contain exponentially many points from some embedded $d$-dimensional subcube if $n$ is sufficiently large.

math.CO↗

arXiv2007

Bloom maps

We consider the problem of succinctly encoding a static map to support approximate queries. We derive upper and lower bounds on the space requirements in terms of the error rate and the entropy of the distribution of values over keys: our bounds differ by a factor log e. For the upper bound we introduce a novel data structure, the Bloom map, generalising the Bloom filter to this problem. The lower bound follows from an information theoretic argument.

cs.DS↗

arXiv2003

Compression and Erdos-Ko-Rado graphs

For a graph G and integer r\geq 1 we denote the collection of independent r-sets of G by I^{(r)}(G). If v\in V(G) then I_v^{(r)}(G) is the collection of all independent r-sets containing v. A graph G, is said to be r-EKR, for r\geq 1, iff no intersecting family A\subseteq I^{(r)}(G) is larger than max_{v\in V(G)}|I^{(r)}_v(G)|. There are various graphs which are known to have this property: the empty graph of order n\geq 2r (this is the celebrated Erdos-Ko-Rado theorem), any disjoint union of at least r copies of K_t for t\geq 2, and any cycle. In this paper we show how these results can be extended to other classes of graphs via a compression proof technique. In particular we show that any disjoint union of at least r complete graphs, each of order at least two, is r-EKR. We also show that paths are r-EKR for all r\geq 1.

math.CO↗

arXiv2003

Graphs with the Erdos-Ko-Rado property

For a graph G and integer r \geq 1 we denote the family of independent r-sets of V(G) by I^{(r)}(G). A graph G is said to be r-EKR if no intersecting subfamily of I^{(r)}(G) is larger than the largest such family all of whose members contain some fixed v \in V(G). If this inequality is always strict, then G is said to be strictly r-EKR. We show that if a graph G is r-EKR then its lexicographic product with any complete graph is r-EKR. For any graph G, we define μ(G) to be the minimum size of a maximal independent vertex set. We conjecture that, if 1 \leq r \leq 1/2μ(G), then G is r-EKR, and if r<1/2μ(G), then G is strictly r-EKR. This is known to be true when G is an empty graph, a cycle, a path or the disjoint union of complete graphs. We show that it is also true when G is the disjoint union of a pair of complete multipartite graphs.

math.CO↗

arXiv2003

The number of k-intersections of an intersecting family of r-sets

The Erdos-Ko-Rado theorem tells us how large an intersecting family of r-sets from an n-set can be, while results due to Lovasz and Tuza give bounds on the number of singletons that can occur as pairwise intersections of sets from such a family. We consider a natural generalization of these problems. Given an intersecting family of r-sets from an n-set and 1\leq k \leq r, how many k-sets can occur as pairwise intersections of sets from the family? For k=r and k=1 this reduces to the problems described above. We answer this question exactly for all values of k and r, when n is sufficiently large. We also characterize the extremal families.

math.CO↗

arXiv2002

Intersecting Families of Separated Sets

We prove a conjecture due to Holroyd and Johnson that an analogue of the Erdos-Ko-Rado theorem holds for k-separated sets. In particular this determines the independence number of the vertex-critical subgraph of the Kneser graph identified by Schrijver, the collection of separated sets.

math.CO↗