arXiv subjects

Hao Huang

Publications and source records attributed to Hao Huang.

214 records · Page 12Linked to original sources

arXiv2014

The minimum number of nonnegative edges in hypergraphs

An r-unform n-vertex hypergraph H is said to have the Manickam-Miklós-Singhi (MMS) property if for every assignment of weights to its vertices with nonnegative sum, the number of edges whose total weight is nonnegative is at least the minimum degree of H. In this paper we show that for n>10r^3, every r-uniform n-vertex hypergraph with equal codegrees has the MMS property, and the bound on n is essentially tight up to a constant factor. This result has two immediate corollaries. First it shows that every set of n>10k^3 real numbers with nonnegative sum has at least $\binom{n-1}{k-1}$ nonnegative k-sums, verifying the Manickam-Miklós-Singhi conjecture for this range. More importantly, it implies the vector space Manickam-Miklós-Singhi conjecture which states that for n >= 4k and any weighting on the 1-dimensional subspaces of F_q^n with nonnegative sum, the number of nonnegative k-dimensional subspaces is at least ${n-1 \brack k-1}_q$. We also discuss two additional generalizations, which can be regarded as analogues of the Erdős-Ko-Rado theorem on k-intersecting families.

math.CO↗

arXiv2014

Maximizing the number of nonnegative subsets

Given a set of $n$ real numbers, if the sum of elements of every subset of size larger than $k$ is negative, what is the maximum number of subsets of nonnegative sum? In this note we show that the answer is $\binom{n-1}{k-1} + \binom{n-1}{k-2} + \cdots + \binom{n-1}{0}+1$, settling a problem of Tsukerman. We provide two proofs, the first establishes and applies a weighted version of Hall's Theorem and the second is based on an extension of the nonuniform Erdős-Ko-Rado Theorem.

math.CO↗

arXiv2013

The Ginger-shaped Asteroid 4179 Toutatis: New Observations from a Successful Flyby of Chang'e-2

On 13 December 2012, Chang'e-2 conducted a successful flyby of the near-Earth asteroid 4179 Toutatis at a closest distance of 770 $\pm$ 120 meters from the asteroid's surface. The highest-resolution image, with a resolution of better than 3 meters, reveals new discoveries on the asteroid, e.g., a giant basin at the big end, a sharply perpendicular silhouette near the neck region, and direct evidence of boulders and regolith, which suggests that Toutatis may bear a rubble-pile structure. Toutatis' maximum physical length and width are (4.75 $\times$ 1.95 km) $\pm$10$\%$, respectively, and the direction of the +$z$ axis is estimated to be (250$\pm$5$^\circ$, 63$\pm$5$^\circ$) with respect to the J2000 ecliptic coordinate system. The bifurcated configuration is indicative of a contact binary origin for Toutatis, which is composed of two lobes (head and body). Chang'e-2 observations have significantly improved our understanding of the characteristics, formation, and evolution of asteroids in general.

astro-ph.EP↗

arXiv2013

On the 3-local profiles of graphs

For a graph G, let p_i(G), i=0,...,3 be the probability that three distinct random vertices span exactly i edges. We call (p_0(G),...,p_3(G)) the 3-local profile of G. We investigate the set ${\cal S}_3 \subset \mathbb R^4$ of all vectors (p_0,...,p_3) that are arbitrarily close to the 3-local profiles of arbitrarily large graphs. We give a full description of the projection of ${\cal S}_3$ to the (p_0, p_3) plane. The upper envelope of this planar domain is obtained from cliques on a fraction of the vertex set and complements of such graphs. The lower envelope is Goodman's inequality p_0+p_3\geq 1/4. We also give a full description of the triangle-free case, i.e., the intersection of ${\cal S}_3$ with the hyperplane p_3=0. This planar domain is characterized by an SDP constraint that is derived from Razborov's flag algebra theory.

math.CO↗

arXiv2013

On the densities of cliques and independent sets in graphs

Let r, s >= 2 be integers. Suppose that the number of blue r-cliques in a red/blue coloring of the edges of the complete graph K_n is known and fixed. What is the largest possible number of red s-cliques under this assumption? The well known Kruskal-Katona theorem answers this question for r=2 or s=2. Using the shifting technique from extremal set theory together with some analytical arguments, we resolve this problem in general and prove that in the extremal coloring either the blue edges or the red edges form a clique.

math.CO↗

arXiv2013

Deterministic bootstrap percolation in high dimensional grids

In this paper, we study the k-neighbor bootstrap percolation process on the d-dimensional grid [n]^d, and show that the minimum number of initial vertices that percolate is (1-d/k)n^d + O(n^{d-1})$ when d<=k<=2d. This confirms a conjecture of Pete.

math.CO↗

arXiv2013

On the maximum induced density of directed stars and related problems

Let k>=3 be an integer, we prove that the maximum induced density of the k-vertex directed star in a directed graph is attained by an iterated blow-up construction. This confirms a conjecture by Falgas-Ravry and Vaughan, who proved this for k=3, 4. This question provides the first known instance of density problem for which one can prove extremality of an iterated blow-up construction. We also study the inducibility of complete bipartite digraphs and discuss other related problems.

math.CO↗

arXiv2012

A problem of Erdős on the minimum number of $k$-cliques

Fifty years ago Erdős asked to determine the minimum number of $k$-cliques in a graph on $n$ vertices with independence number less than l. He conjectured that this minimum is achieved by the disjoint union of $l-1$ complete graphs of size $\frac{n}{l-1}$. This conjecture was disproved by Nikiforov who showed that the balanced blow-up of a 5-cycle has fewer 4-cliques than the union of 2 complete graphs of size $\frac{n}{2}$. In this paper we solve Erdős' problem for $(k,l)=(3,4)$ and $(k,l)=(4,3)$. Using stability arguments we also characterize the precise structure of extremal examples, confirming Erdős' conjecture for $(k,l)=(3,4)$ and showing that a blow-up of a 5-cycle gives the minimum for $(k,l)=(4,3)$.

math.CO↗

arXiv2012

Large feedback arc sets, high minimum degree subgraphs, and long cycles in Eulerian digraphs

A minimum feedback arc set of a directed graph $G$ is a smallest set of arcs whose removal makes $G$ acyclic. Its cardinality is denoted by $β(G)$. We show that an Eulerian digraph with $n$ vertices and $m$ arcs has $β(G) \ge m^2/2n^2+m/2n$, and this bound is optimal for infinitely many $m, n$. Using this result we prove that an Eulerian digraph contains a cycle of length at most $6n^2/m$, and has an Eulerian subgraph with minimum degree at least $m^2/24n^3$. Both estimates are tight up to a constant factor. Finally, motivated by a conjecture of Bollobás and Scott, we also show how to find long cycles in Eulerian digraphs.

math.CO↗

arXiv2012

Large matchings in uniform hypergraphs and the conjectures of Erdos and Samuels

In this paper we study conditions which guarantee the existence of perfect matchings and perfect fractional matchings in uniform hypergraphs. We reduce this problem to an old conjecture by Erdős on estimating the maximum number of edges in a hypergraph when the (fractional) matching number is given, which we are able to solve in some special cases using probabilistic techniques. Based on these results, we obtain some general theorems on the minimum $d$-degree ensuring the existence of perfect (fractional) matchings. In particular, we asymptotically determine the minimum vertex degree which guarantees a perfect matching in 4-uniform and 5-uniform hypergraphs. We also discuss an application to a problem of finding an optimal data allocation in a distributed storage system.

math.CO↗

arXiv2011

Rapid Mid-Infrared Variability in Protostellar Disks

Spectral energy distribution (SED) in protostellar disks is determined by the disks'internal dissipation and reprocessing of irradiation from their host stars. Around T Tauri stars, most mid-infrared (MIR) radiation (in a few to a few ten μm wavelength range) emerge from regions around a fraction to a few AU's. This region is interesting because it contains both the habitable zone and the snow line. Recent observations reveal that SED variations, in the MIR wavelength range. These variations are puzzling because they occur on time scale (a few days) which is much shorter than the dynamical (months to years) time scale at 1AU to a few AU's. They are probably caused by shadows casted by inner onto outer disk regions. Interaction between disks and their misaligned magnetized host stars can lead to warped structure and periodic SED modulations. Rapid aperiodic SED variations may also be induced by observed X-ray flares from T Tauri stars. These flares can significantly modulate the ionization fraction of the gas and the net charge carried by the grains near the surface of the inner disk. The newly charged grains may be accelerated by the stellar or disk magnetic field and adjust their distances from the midplane. Shadows casted by these grains attenuates the flux of stellar photons irradiated onto regions at several AU's from the central stars. We use this model to account for the observed rapid aperiodic SED variabilities. We suggest regular monitoring of SED variations will not only provide valuable information on the distribution of the disk aspect ratio near the habitable zone but also provide a probe on the interaction between the inner regions of the disk with the magnetosphere of their host stars.

astro-ph.EP↗

arXiv2011

The size of a hypergraph and its matching number

More than forty years ago, Erdős conjectured that for any T <= N/K, every K-uniform hypergraph on N vertices without T disjoint edges has at most max{\binom{KT-1}{K}, \binom{N}{K} - \binom{N-T+1}{K}} edges. Although this appears to be a basic instance of the hypergraph Turán problem (with a T-edge matching as the excluded hypergraph), progress on this question has remained elusive. In this paper, we verify this conjecture for all T < N/(3K^2). This improves upon the best previously known range T = O(N/K^3), which dates back to the 1970's.

math.CO↗

arXiv2011

Nonnegative k-sums, fractional covers, and probability of small deviations

More than twenty years ago, Manickam, Miklós, and Singhi conjectured that for any integers $n, k$ satisfying $n \geq 4k$, every set of $n$ real numbers with nonnegative sum has at least $\binom{n-1}{k-1}$ $k$-element subsets whose sum is also nonnegative. In this paper we discuss the connection of this problem with matchings and fractional covers of hypergraphs, and with the question of estimating the probability that the sum of nonnegative independent random variables exceeds its expectation by a given amount. Using these connections together with some probabilistic techniques, we verify the conjecture for $n \geq 33k^2$. This substantially improves the best previously known exponential lower bound $n \geq e^{ck \log\log k}$. In addition we prove a tight stability result showing that for every $k$ and all sufficiently large $n$, every set of $n$ reals with a nonnegative sum that does not contain a member whose sum with any other $k-1$ members is nonnegative, contains at least $\binom{n-1}{k-1}+\binom{n-k-1}{k-1}-1$ subsets of cardinality $k$ with nonnegative sum.

math.CO↗

arXiv2011

Quasi-randomness of graph balanced cut properties

Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yuster proved the following result on quasi-randomness of graphs. Let $k \ge 2$ be a fixed integer, $α_1,...,α_k$ be positive reals satisfying $\sum_{i} α_i = 1$ and $(α_1,..., α_k) \neq (1/k,...,1/k)$, and $G$ be a graph on $n$ vertices. If for every partition of the vertices of $G$ into sets $V_1,..., V_k$ of size $α_1 n,..., α_k n$, the number of complete graphs on $k$ vertices which have exactly one vertex in each of these sets is similar to what we would expect in a random graph, then the graph is quasi-random. However, the method of quasi-random hypergraphs they used did not provide enough information to resolve the case $(1/k,..., 1/k)$ for graphs. In their work, Shapira and Yuster asked whether this case also forces the graph to be quasi-random. Janson also posed the same question in his study of quasi-randomness under the framework of graph limits. In this paper, we positively answer their question.

math.CO↗

arXiv2011

Bandwidth theorem for random graphs

A graph $G$ is said to have \textit{bandwidth} at most $b$, if there exists a labeling of the vertices by $1,2,..., n$, so that $|i - j| \leq b$ whenever $\{i,j\}$ is an edge of $G$. Recently, Böttcher, Schacht, and Taraz verified a conjecture of Bollobás and Komlós which says that for every positive $r,Δ,γ$, there exists $β$ such that if $H$ is an $n$-vertex $r$-chromatic graph with maximum degree at most $Δ$ which has bandwidth at most $βn$, then any graph $G$ on $n$ vertices with minimum degree at least $(1 - 1/r + γ)n$ contains a copy of $H$ for large enough $n$. In this paper, we extend this theorem to dense random graphs. For bipartite $H$, this answers an open question of Böttcher, Kohayakawa, and Taraz. It appears that for non-bipartite $H$ the direct extension is not possible, and one needs in addition that some vertices of $H$ have independent neighborhoods. We also obtain an asymptotically tight bound for the maximum number of vertex disjoint copies of a fixed $r$-chromatic graph $H_0$ which one can find in a spanning subgraph of $G(n,p)$ with minimum degree $(1-1/r + γ)np$.

math.CO↗

arXiv2010

A counterexample to the Alon-Saks-Seymour conjecture and related problems

Consider a graph obtained by taking edge disjoint union of $k$ complete bipartite graphs. Alon, Saks and Seymour conjectured that such graph has chromatic number at most $k+1$. This well known conjecture remained open for almost twenty years. In this paper, we construct a counterexample to this conjecture and discuss several related problems in combinatorial geometry and communication complexity.

math.CO↗