- Award ID(s):
- 1926686
- NSF-PAR ID:
- 10447724
- Date Published:
- Journal Name:
- Forum of Mathematics, Sigma
- Volume:
- 10
- ISSN:
- 2050-5094
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
Abstract Given a hereditary property of graphs $\mathcal{H}$ and a $p\in [0,1]$ , the edit distance function $\textrm{ed}_{\mathcal{H}}(p)$ is asymptotically the maximum proportion of edge additions plus edge deletions applied to a graph of edge density p sufficient to ensure that the resulting graph satisfies $\mathcal{H}$ . The edit distance function is directly related to other well-studied quantities such as the speed function for $\mathcal{H}$ and the $\mathcal{H}$ -chromatic number of a random graph. Let $\mathcal{H}$ be the property of forbidding an Erdős–Rényi random graph $F\sim \mathbb{G}(n_0,p_0)$ , and let $\varphi$ represent the golden ratio. In this paper, we show that if $p_0\in [1-1/\varphi,1/\varphi]$ , then a.a.s. as $n_0\to\infty$ , \begin{align*} {\textrm{ed}}_{\mathcal{H}}(p) = (1+o(1))\,\frac{2\log n_0}{n_0} \cdot\min\left\{ \frac{p}{-\log(1-p_0)}, \frac{1-p}{-\log p_0} \right\}. \end{align*} Moreover, this holds for $p\in [1/3,2/3]$ for any $p_0\in (0,1)$ . A primary tool in the proof is the categorization of p -core coloured regularity graphs in the range $p\in[1-1/\varphi,1/\varphi]$ . Such coloured regularity graphs must have the property that the non-grey edges form vertex-disjoint cliques.more » « less
-
Abstract Let $X$ be a measure space with a measure-preserving action $(g,x) \mapsto g \cdot x$ of an abelian group $G$. We consider the problem of understanding the structure of measurable tilings $F \odot A = X$ of $X$ by a measurable tile $A \subset X$ translated by a finite set $F \subset G$ of shifts, thus the translates $f \cdot A$, $f \in F$ partition $X$ up to null sets. Adapting arguments from previous literature, we establish a “dilation lemma” that asserts, roughly speaking, that $F \odot A = X$ implies $F^{r} \odot A = X$ for a large family of integer dilations $r$, and use this to establish a structure theorem for such tilings analogous to that established recently by the second and fourth authors. As applications of this theorem, we completely classify those random tilings of finitely generated abelian groups that are “factors of iid”, and show that measurable tilings of a torus ${\mathbb{T}}^{d}$ can always be continuously (in fact linearly) deformed into a tiling with rational shifts, with particularly strong results in the low-dimensional cases $d=1,2$ (in particular resolving a conjecture of Conley, the first author, and Pikhurko in the $d=1$ case).more » « less
-
null (Ed.)Abstract We initiate the study of Schrödinger operators with ergodic potentials defined over circle map dynamics, in particular over circle diffeomorphisms. For analytic circle diffeomorphisms and a set of rotation numbers satisfying Yoccoz’s ${{\mathcal{H}}}$ arithmetic condition, we discuss an extension of Avila’s global theory. We also give an abstract version and a short proof of a sharp Gordon-type theorem on the absence of eigenvalues for general potentials with repetitions. Coupled with the dynamical analysis, we obtain that, for every $C^{1+BV}$ circle diffeomorphism, with a super Liouville rotation number and an invariant measure $\mu $, and for $\mu $-almost all $x\in{{\mathbb{T}}}^1$, the corresponding Schrödinger operator has purely continuous spectrum for every Hölder continuous potential $V$.more » « less
-
Abstract Let M be a complete Riemannian manifold and suppose {p\in M} . For each unit vector {v\in T_{p}M} , the Jacobi operator , {\mathcal{J}_{v}:v^{\perp}\rightarrow v^{\perp}} is the symmetric endomorphism, {\mathcal{J}_{v}(w)=R(w,v)v} . Then p is an isotropic point if there exists a constant {\kappa_{p}\in{\mathbb{R}}} such that {\mathcal{J}_{v}=\kappa_{p}\operatorname{Id}_{v^{\perp}}} for each unit vector {v\in T_{p}M} . If all points are isotropic, then M is said to be isotropic; it is a classical result of Schur that isotropic manifolds of dimension at least 3 have constant sectional curvatures. In this paper we consider almost isotropic manifolds , i.e. manifolds having the property that for each {p\in M} , there exists a constant {\kappa_{p}\in\mathbb{R}} such that the Jacobi operators {\mathcal{J}_{v}} satisfy {\operatorname{rank}({\mathcal{J}_{v}-\kappa_{p}\operatorname{Id}_{v^{\perp}}}% )\leq 1} for each unit vector {v\in T_{p}M} . Our main theorem classifies the almost isotropic simply connected Kähler manifolds, proving that those of dimension {d=2n\geqslant 4} are either isometric to complex projective space or complex hyperbolic space or are totally geodesically foliated by leaves isometric to {{\mathbb{C}}^{n-1}} .more » « less
-
Abstract Approximate integer programming is the following: For a given convex body
, either determine whether$$K \subseteq {\mathbb {R}}^n$$ is empty, or find an integer point in the convex body$$K \cap {\mathbb {Z}}^n$$ which is$$2\cdot (K - c) +c$$ K , scaled by 2 from its center of gravityc . Approximate integer programming can be solved in time while the fastest known methods for exact integer programming run in time$$2^{O(n)}$$ . So far, there are no efficient methods for integer programming known that are based on approximate integer programming. Our main contribution are two such methods, each yielding novel complexity results. First, we show that an integer point$$2^{O(n)} \cdot n^n$$ can be found in time$$x^* \in (K \cap {\mathbb {Z}}^n)$$ , provided that the$$2^{O(n)}$$ remainders of each component for some arbitrarily fixed$$x_i^* \mod \ell $$ of$$\ell \ge 5(n+1)$$ are given. The algorithm is based on a$$x^*$$ cutting-plane technique , iteratively halving the volume of the feasible set. The cutting planes are determined via approximate integer programming. Enumeration of the possible remainders gives a algorithm for general integer programming. This matches the current best bound of an algorithm by Dadush (Integer programming, lattice algorithms, and deterministic, vol. Estimation. Georgia Institute of Technology, Atlanta, 2012) that is considerably more involved. Our algorithm also relies on a new$$2^{O(n)}n^n$$ asymmetric approximate Carathéodory theorem that might be of interest on its own. Our second method concerns integer programming problems in equation-standard form . Such a problem can be reduced to the solution of$$Ax = b, 0 \le x \le u, \, x \in {\mathbb {Z}}^n$$ approximate integer programming problems. This implies, for example that$$\prod _i O(\log u_i +1)$$ knapsack orsubset-sum problems withpolynomial variable range can be solved in time$$0 \le x_i \le p(n)$$ . For these problems, the best running time so far was$$(\log n)^{O(n)}$$ .$$n^n \cdot 2^{O(n)}$$