Search

We introduce a graph Ramsey game called Ramsey, Paper, Scissors. This game has two players, Proposer and Decider. Starting from an empty graph on $n$ vertices, on each turn Proposer proposes a potential edge and Decider simultaneously decides (without knowing Proposer's choice) whether to add it to the graph. Proposer cannot propose an edge which would create a triangle in the graph. The game ends when Proposer has no legal moves remaining, and Proposer wins if the final graph has independence number at least $s$. We prove a threshold phenomenon exists for this game by exhibiting randomized strategies for both players that are optimal up to constants. Namely, there exist constants $0B\sqrt{n}\log{n}$. This is a factor of $\Theta(\sqrt{\log{n}})$ larger than the lower bound coming from the off-diagonal Ramsey number $r(3,s)$.

The aim of this paper is to discuss the main result in the paper by D.Y. Gao and X. Lu [On the extrema of a nonconvex functional with double-well potential in 1D, Z. Angew. Math. Phys. (2016) 67:62]. More precisely we provide a detailed study of the problem considered in that paper, pointing out the importance of the norm on the space $C^{1}[a,b]$; because no norm (topology) is mentioned on $C^{1}[a,b]$ we look at it as being a subspace of $W^{1,p}(a,b)$ for $p\in [1,\infty]$ endowed with its usual norm. We show that the objective function has not local extrema with the mentioned constraints for $p\in [1,4)$, and has (up to an additive constant) only a local maximizer for $p=\infty$, unlike the conclusion of the main result of the discussed paper where it is mentioned that there are (up to additive constants) two local minimizers and a local maximizer. We also show that the same conclusions are valid for the similar problem treated in the preprint by X. Lu and D.Y. Gao [On the extrema of a nonconvex functional with double-well potential in higher dimensions, arXiv:1607.03995]., 12 pages; in this version we added the forgotten condition $F(x) \ne 0$ for $x\in (a,b)$ on page 3

The paper is devoted to coverings by translative homothets and illuminations of convex bodies. For a given positive number $\alpha$ and a convex body $B$, $g_{\alpha}(B)$ is the infimum of $\alpha$-powers of finitely many homothety coefficients less than 1 such that there is a covering of $B$ by translative homothets with these coefficients. $h_{\alpha}(B)$ is the minimal number of directions such that the boundary of $B$ can be illuminated by this number of directions except for a subset whose Hausdorff dimension is less than $\alpha$. In this paper, we prove that $g_{\alpha}(B)\leq h_{\alpha}(B)$, find upper and lower bounds for both numbers, and discuss several general conjectures. In particular, we show that $h_{\alpha} (B) > 2^{d-\alpha}$ for almost all $\alpha$ and $d$ when $B$ is the $d$-dimensional cube, thus disproving the conjecture from Research Problems in Discrete Geometry by Brass, Moser, and Pach.

In 1993, Shub and Smale posed the problem of finding a sequence of univariate polynomials of degree $N$ with condition number bounded above by $N$. In a previous paper by C. Belt\'an, U. Etayo, J. Marzo and J. Ortega-Cerd\`a, it was proved that the optimal value of the condition number is of the form $O(\sqrt{N})$, and the sequence demanded by Shub and Smale was described by a closed formula (for large enough $N\geqslant N_0$ with $N_0$ unknown) and by a search algorithm for the rest of the cases. In this paper we find concrete estimates for the constant hidden in the $O(\sqrt{N})$ term and we describe a simple formula for a sequence of polynomials whose condition number is at most $N$, valid for all $N=4M^2$, with $M$ a positive integer., Comment: 21 pages

In 1980, Onishchik introduced the index of a Riemannian symmetric space as the minimal codimension of a (proper) totally geodesic submanifold. He calculated the index for symmetric spaces of rank less than or equal to 2, but for higher rank it was unclear how to tackle the problem. In earlier papers we developed several approaches to this problem, which allowed us to calculate the index for many symmetric spaces. Our systematic approach led to a conjecture for how to calculate the index. The purpose of this paper is to verify the conjecture., 33 pages; Table 1 corrected; to appear in Journal fuer die Reine und Angewandte Mathematik

Given a graph $G$ and a nondecreasing sequence $S=(s_1,\ldots,s_k)$ of positive integers, the mapping $c:V(G)\longrightarrow \{1,\ldots,k\}$ is called an $S$-packing coloring of $G$ if for any two distinct vertices $x$ and $y$ in $c^{-1}(i)$, the distance between $x$ and $y$ is greater than $s_i$. The smallest integer $k$ such that there exists a $(1,2,\ldots,k)$-packing coloring of a graph $G$ is called the packing chromatic number of $G$, denoted $\chi_{\rho}(G)$. The question of boundedness of the packing chromatic number in the class of subcubic (planar) graphs was investigated in several earlier papers; recently it was established that the invariant is unbounded in the class of all subcubic graphs. In this paper, we prove that the packing chromatic number of any 2-connected bipartite subcubic outerplanar graph is bounded by $7$. Furthermore, we prove that every subcubic triangle-free outerplanar graph has a $(1,2,2,2)$-packing coloring, and that there exists a subcubic outerplanar graph with a triangle that does not admit a $(1,2,2,2)$-packing coloring. In addition, there exists a subcubic triangle-free outerplanar graph that does not admit a $(1,2,2,3)$-packing coloring. A similar dichotomy is shown for bipartite outerplanar graphs: every such graph admits an $S$-packing coloring for $S=(1,3,\ldots,3)$, where $3$ appears $\Delta$ times ($\Delta$ being the maximum degree of vertices), and this property does not hold if one of the integers $3$ is replaced by $4$ in the sequence $S$., Comment: 24 pages

In this paper we show how to explicitly write down equations of hyperelliptic curves over Q such that for all odd primes l the image of the mod l Galois representation is the general symplectic group. The proof relies on understanding the action of inertia groups on the l-torsion of the Jacobian, including at primes where the Jacobian has non-semistable reduction. We also give a framework for systematically dealing with primitivity of symplectic mod l Galois representations. The main result of the paper is the following. Suppose n=2g+2 is an even integer that can be written as a sum of two primes in two different ways, with none of the primes being the largest primes less than n (this hypothesis appears to hold for all g different from 0,1,2,3,4,5,7 and 13). Then there is an explicit integer N and an explicit monic polynomial $f_0(x)\in \mathbb{Z}[x]$ of degree n, such that the Jacobian $J$ of every curve of the form $y^2=f(x)$ has $Gal(\mathbb{Q}(J[l])/\mathbb{Q})\cong GSp_{2g}(\mathbb{F}_l)$ for all odd primes l and $Gal(\mathbb{Q}(J[2])/\mathbb{Q})\cong S_{2g+2}$, whenever $f(x)\in\mathbb{Z}[x]$ is monic with $f(x)\equiv f_0(x) \bmod{N}$ and with no roots of multiplicity greater than $2$ in $\overline{\mathbb{F}}_p$ for any p not dividing N., Comment: 24 pages, minor corrections

Let $L$ be a fixed branch -- that is, an irreducible germ of curve -- on a normal surface singularity $X$. If $A,B$ are two other branches, define $u_L(A,B) := \dfrac{(L \cdot A) \: (L \cdot B)}{A \cdot B}$, where $A \cdot B$ denotes the intersection number of $A$ and $B$. Call $X$ arborescent if all the dual graphs of its resolutions are trees. In a previous paper, the first three authors extended a 1985 theorem of P{\l}oski by proving that whenever $X$ is arborescent, the function $u_L$ is an ultrametric on the set of branches on $X$ different from $L$. In the present paper we prove that, conversely, if $u_L$ is an ultrametric, then $X$ is arborescent. We also show that for any normal surface singularity, one may find arbitrarily large sets of branches on $X$, characterized uniquely in terms of the topology of the resolutions of their sum, in restriction to which $u_L$ is still an ultrametric. Moreover, we describe the associated tree in terms of the dual graphs of such resolutions. Then we extend our setting by allowing $L$ to be an arbitrary semivaluation on $X$ and by defining $u_L$ on a suitable space of semivaluations. We prove that any such function is again an ultrametric if and only if $X$ is arborescent, and without any restriction on $X$ we exhibit special subspaces of the space of semivaluations in restriction to which $u_L$ is still an ultrametric., Comment: 50 pages, 14 figures. Final version

In this paper, we study the spectrality and frame-spectrality of exponential systems of the type $$E(\Lambda ,\varphi ) = \{e^{2\pi i \lambda \cdot \varphi (x)}: \lambda \in \Lambda \}$$ where the phase function $$\varphi $$ is a Borel measurable which is not necessarily linear. A complete characterization of pairs $$(\Lambda ,\varphi )$$ for which $$E(\Lambda ,\varphi )$$ is an orthogonal basis or a frame for $$L^{2}(\mu )$$ is obtained. In particular, we show that the middle-third Cantor measures and the unit disc, each admits an orthogonal basis with a certain non-linear phase. Under a natural regularity condition on the phase functions, when $$\mu $$ is the Lebesgue measure on [0, 1] and $$\Lambda = {{\mathbb {Z}}},$$ we show that only the standard phase functions $$\varphi (x) = \pm x$$ are the only possible functions that give rise to orthonormal bases. Surprisingly, however we prove that there exist a greater degree of flexibility, even for continuously differentiable phase functions in higher dimensions. For instance, we were able to describe a large class of functions $$\varphi $$ defined on $${{\mathbb {R}}}^{d}$$ such that the system $$E(\Lambda ,\varphi )$$ is an orthonormal basis for $$L^{2}[0,1]^{d}$$ when $$d\ge 2.$$ Moreover, we discuss how our results apply to the discretization problem of unitary representations of locally compact groups for the construction of orthonormal bases. Finally, we conclude the paper by stating several open problems.

In this paper we introduce a general framework for the study of limits of relational structures in general and graphs in particular, which is based on a combination of model theory and (functional) analysis. We show how the various approaches to graph limits fit to this framework and that they naturally appear as "tractable cases" of a general theory. As an outcome of this, we provide extensions of known results. We believe that this put these into next context and perspective. For example, we prove that the sparse--dense dichotomy exactly corresponds to random free graphons. The second part of the paper is devoted to the study of sparse structures. First, we consider limits of structures with bounded diameter connected components and we prove that in this case the convergence can be "almost" studied component-wise. We also propose the structure of limits objects for convergent sequences of sparse structures. Eventually, we consider the specific case of limits of colored rooted trees with bounded height and of graphs with bounded tree-depth, motivated by their role of elementary brick these graphs play in decompositions of sparse graphs, and give an explicit construction of a limit object in this case. This limit object is a graph built on a standard probability space with the property that every first-order definable set of tuples is measurable. This is an example of the general concept of {\em modeling} we introduce here. Our example is also the first "intermediate class" with explicitly defined limit structures., Comment: added journal reference

Given a graph $G$, a probability measure $\mu$ on the subsets of the edge set of $G$ is said to be $1$-independent if events determined by edge sets that are at graph distance at least $1$ apart in $G$ are independent. Call such a probability measure a $1$-ipm on $G$, and denote by $\mathbf{G}_{\mu}$ the associated random spanning subgraph of $G$. Let $\mathcal{M}_{1,\geqslant p}(G)$ (resp. $\mathcal{M}_{1,\leqslant p}(G)$) denote the collection of $1$-ipms $\mu$ on $G$ for which each edge is included in $\mathbf{G}_{\mu}$ with probability at least $p$ (resp. at most $p$). Let $\mathbb{Z}^2$ denote the square integer lattice. Balister and Bollob\'as raised the question of determining the critical value $p_{\star}=p_{1,c}(\mathbb{Z}^2)$ such that for all $p>p_{\star}$ and all $\mu \in \mathcal{M}_{1,\geqslant p}(\mathbb{Z}^2)$, $\left(\mathbf{\mathbb{Z}^2}\right)_{\mu}$ almost surely contains an infinite component. This can be thought of as asking for a $1$-independent analogue of the celebrated Harris--Kesten theorem. In this paper we investigate both this problem and connectivity problems for $1$-ipms more generally. We give two lower bounds on $p_{\star}$ that significantly improve on the previous bounds. Furthermore, motivated by the Russo--Seymour--Welsh lemmas, we define a $1$-independent critical probability for long paths and determine its value for the line and ladder lattices. Finally, for finite graphs $G$ we study $f_{1,G}(p)$ (respectively $F_{1,G}(p)$), the infimum (resp. supremum) over all $\mu\in \mathcal{M}_{1,\geqslant p}(G)$ (resp. all $\mu \in \mathcal{M}_{1,\leqslant p}(G)$) of the probability that $\mathbf{G}_{\mu}$ is connected. We determine $f_{1,G}(p)$ and $F_{1,G}(p)$ exactly when $G$ is a path, a complete graph and a cycle of length at most $5$. Many new problems arise from our work, which are discussed in the final section of the paper., Comment: 43 pages, 3 figures

Variants of the coordinate descent approach for minimizing a nonlinear function are distinguished in part by the order in which coordinates are considered for relaxation. Three common orderings are cyclic (CCD), in which we cycle through the components of $x$ in order; randomized (RCD), in which the component to update is selected randomly and independently at each iteration; and random-permutations cyclic (RPCD), which differs from CCD only in that a random permutation is applied to the variables at the start of each cycle. Known convergence guarantees are weaker for CCD and RPCD than for RCD, though in most practical cases, computational performance is similar among all these variants. There is a certain type of quadratic function for which CCD is significantly slower than for RCD; a recent paper by Sun & Ye (2016, Worst-case complexity of cyclic coordinate descent: $O(n^2)$ gap with randomized version. Technical Report. Stanford, CA: Department of Management Science and Engineering, Stanford University. arXiv:1604.07130) has explored the poor behavior of CCD on functions of this type. The RPCD approach performs well on these functions, even better than RCD in a certain regime. This paper explains the good behavior of RPCD with a tight analysis.

The motivating question of this paper is roughly the following: given a group scheme $G$ over $\mathbb{Z}_p$, $p$ prime, with semisimple generic fiber $G_{\mathbb{Q}_p}$, how far are open subgroups of $G(\mathbb{Z}_p)$ from subgroups of the form $X(\mathbb{Z}_p)\mathbf{K}_p(p^n)$, where $X$ is a subgroup scheme of $G$ and $\mathbf{K}_p(p^n)$ is the principal congruence subgroup $\operatorname{Ker} (G(\mathbb{Z}_p)\rightarrow G(\mathbb{Z}/p^n\mathbb{Z}))$? More precisely, we will show that for $G_{\mathbb{Q}_p}$ simply connected there exist constants $J\ge1$ and $\varepsilon>0$, depending only on $G$, such that any open subgroup of $G (\mathbb{Z}_p)$ of level $p^n$ admits an open subgroup of index $\le J$ which is contained in $X(\mathbb{Z}_p)\mathbf{K}_p(p^{\lceil \varepsilon n\rceil})$ for some proper connected algebraic subgroup $X$ of $G$ defined over $\mathbb{Q}_p$. Moreover, if $G$ is defined over $\mathbb{Z}$, then $\varepsilon$ and $J$ can be taken independently of $p$. We also give a correspondence between natural classes of $\mathbb{Z}_p$-Lie subalgebras of $\mathfrak{g}_{\mathbb{Z}_p}$ and of closed subgroups of $G(\mathbb{Z}_p)$ that can be regarded as a variant over $\mathbb{Z}_p$ of Nori's results on the structure of finite subgroups of $\operatorname{GL}(N_0,\mathbb{F}_p)$ for large $p$. As an application we give a bound for the volume of the intersection of a conjugacy class in the group $G (\hat{\mathbb{Z}}) = \prod_p G (\mathbb{Z}_p)$, for $G$ defined over $\mathbb{Z}$, with an arbitrary open subgroup. In a future paper, this result will be applied to the limit multiplicity problem for arbitrary congruence subgroups of the arithmetic lattice $G (\mathbb{Z})$., fixed a few inaccuracies and made some stylistic changes to appear in JEMS

The theme of this paper is the analysis of bootstrap percolation processes on random graphs generated by preferential attachment. This is a class of infection processes where vertices have two states: they are either infected or susceptible. At each round every susceptible vertex which has at least $r\geq 2$ infected neighbours becomes infected and remains so forever. Assume that initially $a(t)$ vertices are randomly infected, where $t$ is the total number of vertices of the graph. Suppose also that $r < m$, where $2m$ is the average degree. We determine a critical function $a_c(t)$ such that when $a(t) \gg a_c(t)$, complete infection occurs with high probability as $t \rightarrow \infty$, but when $a(t) \ll a_c (t)$, then with high probability the process evolves only for a bounded number of rounds and the final set of infected vertices is asymptotically equal to $a(t)$., This paper is significantly different to the previous version

George Birkhoff proved in 1912 that the number of proper colorings of a finite graph G with n colors is a polynomial in n, called the chromatic polynomial of G. Read conjectured in 1968 that for any graph G, the sequence of absolute values of coefficients of the chromatic polynomial is unimodal: it goes up, hits a peak, and then goes down. Read's conjecture was proved by June Huh in a 2012 paper making heavy use of methods from algebraic geometry. Huh's result was subsequently refined and generalized by Huh and Katz, again using substantial doses of algebraic geometry. Both papers in fact establish log-concavity of the coefficients, which is stronger than unimodality. The breakthroughs of Huh and Huh-Katz left open the more general Rota-Welsh conjecture where graphs are generalized to (not necessarily representable) matroids and the chromatic polynomial of a graph is replaced by the characteristic polynomial of a matroid. The Huh and Huh-Katz techniques are not applicable in this level of generality, since there is no underlying algebraic geometry to which to relate the problem. But in 2015 Adiprasito, Huh, and Katz announced a proof of the Rota-Welsh conjecture based on a novel approach motivated by but not making use of any results from algebraic geometry. The authors first prove that the Rota-Welsh conjecture would follow from combinatorial analogues of the Hard Lefschetz Theorem and Hodge-Riemann relations in algebraic geometry. They then implement an elaborate inductive procedure to prove the combinatorial Hard Lefschetz Theorem and Hodge-Riemann relations using purely combinatorial arguments. We will survey these developments., Comment: 22 pages. This is an expository paper to accompany my lecture at the 2017 AMS Current Events Bulletin. v2: Numerous minor corrections

This paper studies a higher dimensional generalization of Frieze's $\zeta(3)$-limit theorem in the Erd\"os-R\'enyi graph process. Frieze's theorem states that the expected weight of the minimum spanning tree converges to $\zeta(3)$ as the number of vertices goes to infinity. In this paper, we study the $d$-Linial-Meshulam process as a model for random simplicial complexes, where $d=1$ corresponds to the Erd\"os-R\'enyi graph process. First, we define spanning acycles as a higher dimensional analogue of spanning trees, and connect its minimum weight to persistent homology. Then, our main result shows that the expected weight of the minimum spanning acycle behaves in $O(n^{d-1})$., Comment: 24 pages

The k-core, defined as the maximal subgraph of minimum degree at least k, of the random graph G(n,p) has been studied extensively. In a landmark paper Pittel, Wormald and Spencer [J Combin Theory Ser B 67 (1996), 111–151] determined the threshold dk for the appearance of an extensive k-core. The aim of the present paper is to describe how the k-core is “embedded” into the random graph in the following sense. Let k≥3 and fix d=np>dk. Colour each vertex that belongs to the k-core of G(n,p) in black and all remaining vertices in white. Here we derive a multi-type branching process that describes the local structure of this coloured random object as n tends to infinity. This generalises prior results on, e.g., the internal structure of the k-core. In the physics literature it was suggested to characterize the core by means of a message passing algorithm called Warning Propagation. Ibrahimi, Kanoria, Kraning and Montanari [Ann Appl Probab 25 (2015), 2743–2808] used this characterization to describe the 2-core of random hypergraphs. To derive our main result we use a similar approach. A key observation is that a bounded number of iterations of this algorithm is enough to give a good approximation of the k-core. Based on this the study of the k-core reduces to the analysis of Warning Propagation on a suitable Galton-Watson tree. © 2017 Wiley Periodicals, Inc. Random Struct. Alg., 00, 000–000, 2017

We consider consecutive random subdivision of polygons described as follows. Given an initial convex polygon with $d\ge 3$ edges, we choose a point at random on each edge, such that the proportions in which these points divide edges are i.i.d. copies of some random variable $\xi$. These new points form a new (smaller) polygon. By repeatedly implementing this procedure we obtain a sequence of random polygons. The aim of this paper is to show that under very mild non-degenerateness conditions on $\xi$, the shapes of these polygons eventually become "flat" The convergence rate to flatness is also investigated; in particular, in the case of triangles ($d=3$), we show how to calculate the exact value of the rate of convergence, connected to Lyapunov exponents. Using the theory of products of random matrices our paper greatly generalizes the results of Volkov (2013) which are achieved mostly by using ad hoc methods., Comment: 35 pages, 2 figures

The (un)weighted stability for some matrices on a graph is one of essential hypotheses in time-frequency analysis and applied harmonic analysis. In the first part of this paper, we show that for a localized matrix in a Beurling algebra, its weighted stabilities for different exponents and Muckenhoupt weights are equivalent to each other, and reciprocal of its optimal lower stability bound for one exponent and weight is controlled by a polynomial of reciprocal of its optimal lower stability bound for another exponent and weight. Banach algebras of matrices with certain off-diagonal decay is of great importance in many mathematical and engineering fields, and its inverse-closed property can be informally interpreted as localization preservation. Let $${{\mathcal {B}}}(\ell ^p_w)$$ be the Banach algebra of bounded linear operators on the weighted sequence space $$\ell ^p_w$$ on a graph. In the second part of this paper, we prove that Beurling algebras of localized matrices on a connected simple graph are inverse-closed in $${{\mathcal {B}}}(\ell ^p_w)$$ for all $$1\le p

This thesis consists of the following papers.I J. Larsson, The Minimum Matching in Pseudo-dimension 0 0.The second paper lives in a more general setting. There we search for any cover of the ground set V, for general families F. Each set f ∈ F receives weight w(f) uniformly at random from [0,1]. The cost of a cover f_1,f_2,...f_m is then taken to be max_i w(f_i). This is equivalent (after a rescaling) to drawing sets from F at Poisson times, and the cost of a cover is the first time V is covered. This problem is known under a number of names, perhaps most famously the coupon collector problem. In the classical formulation, single elements of V are drawn, not sets. The classical coupon collector thus corresponds to the family F consisting of singleton sets, and we call the version allowing larger sets structured coupon collector problems. The main concern of this paper is to identify relevant properties of F that affect the covering time (i.e. minimal cost of a cover), and to provide (easily checkable) sufficient conditions for concentration of the covering time.For the third paper we narrow the scopes once more, and study the biased random k-SAT problem. The random k-SAT problem can be seen as a special case of the structured coupon collector, but a special case that has far richer structure than the generic case. The ground set is the hypercube Σ_n = {0, 1}^n, and the coupons are all the k-codimensional subcubes of Σ_n. We study a slight variation on this problem: subcubes are drawn with a constant bias towards 0, so that vertices in Σ_n with fewer 1's and more 0's are easier to cover.

In this paper we consider the existence of Hamilton cycles in the random graph $G=G_{n,m}^{��\geq 3}$. This a random graph chosen uniformly from the set of graphs with vertex set $[n]$, $m$ edges and minimum degree at least 3. Our ultimate goal is to prove that if $m=cn$ and $c>3/2$ is constant then $G$ is Hamiltonian w.h.p. In an earlier paper the second author showed that $c\geq 10$ is sufficient for this and in this paper we reduce the lower bound to $c>2.662...$. This new lower bound is the same lower bound found in Frieze and Pittel \cite{FP} for the expansion of so-called P��sa sets., arXiv admin note: text overlap with arXiv:1107.4947

In this paper we are interested in lifting a prescribed group of automorphisms of a finite graph via regular covering projections. Here we describe with an example the problems we address and refer to the introductory section for the correct statements of our results. Let $P$ be the Petersen graph, say, and let $\wp:\tilde{P}\to P$ be a regular covering projection. With the current covering machinery, it is straightforward to find $\wp$ with the property that every subgroup of $\Aut(P)$ lifts via $\wp$. However, for constructing peculiar examples and in applications, this is usually not enough. Sometimes it is important, given a subgroup $G$ of $\Aut(P)$, to find $\wp$ along which $G$ lifts but no further automorphism of $P$ does. For instance, in this concrete example, it is interesting to find a covering of the Petersen graph lifting the alternating group $A_5$ but not the whole symmetric group $S_5$. (Recall that $\Aut(P)\cong S_5$.) Some other time it is important, given a subgroup $G$ of $\Aut(P)$, to find $\wp$ with the property that $\Aut(\tilde{P})$ is the lift of $G$. Typically, it is desirable to find $\wp$ satisfying both conditions. In a very broad sense, this might remind wallpaper patterns on surfaces: the group of symmetries of the dodecahedron is $S_5$, and there is a nice colouring of the dodecahedron (found also by Escher) whose group of symmetries is just $A_5$. In this paper, we address this problem in full generality., Comment: 10 pages

In this work we prove general bounds for the diameter of random graphs generated by a preferential attachment model whose parameter is a function $f:\mathbb{N}\to[0,1]$ that drives the asymptotic proportion between the numbers of vertices and edges. These results are sharp when $f$ is a \textit{regularly varying function at infinity} with strictly negative index of regular variation~$-\gamma$. For this particular class, we prove a characterization for the diameter that depends only on~$-\gamma$. More specifically, we prove that the diameter of such graphs is of order $1/\gamma$ with high probability, although its vertex set order goes to infinity polynomially. Sharp results for the diameter for a wide class of \textit{slowly varying functions} are also obtained., Comment: After referee recommendation, all results not concerning the diameter have been removed to obtain a more streamlined paper. The paper has been published at Random Structures and Algorithms under the new title

Let $\mathscr{C}$ be a 2-Calabi-Yau triangulated category, and let $\mathscr{T}$ be a cluster tilting subcategory of $\mathscr{C}$. An important result from Dehy and Keller tells us that a rigid object $c \in \mathscr{C}$ is uniquely defined by its index with respect to $\mathscr{T}$. The notion of triangulated categories extends to the notion of $(d+2)$-angulated categories. Thanks to a paper by Oppermann and Thomas, we now have a definition for cluster tilting subcategories in higher dimensions. This paper proves that under a technical assumption, an indecomposable object in a $(d+2)$-angulated category is uniquely defined by its index with respect to a higher dimensional cluster tilting subcategory. We also demonstrate an application of this result in higher dimensional cluster categories., Comment: Revising the article based on advice from a referee received upon submitting to a journal. This serves to make the results slightly more general

Staircase tableaux are combinatorial objects that were first introduced due to a connection with the asymmetric simple exclusion process (ASEP) and Askey-Wilson polynomials. Since their introduction, staircase tableaux have been the object of study in many recent papers. Relevant to this paper, Hitczenko and Janson proved that distribution of parameters on the first diagonal is asymptotically normal. In addition, they conjectured that other diagonals would be asymptotically Poisson. Since then, only the second and the third diagonal were proven to follow the conjecture. This paper builds upon those results to prove the conjecture for the kth diagonal where k is fixed. In particular, we prove that the distribution of the number of α's (β's) on the kth diagonal, k > 1, is asymptotically Poisson with parameter 1/2. In addition, we prove that symbols on the kth diagonal are asymptotically independent and thus, collectively follow the Poisson distribution with parameter 1. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 49, 795–818, 2016

In a recent paper, Duncan, Griffin and Ono provide exact formulas for the coefficients of McKay-Thompson series and use them to find asymptotic expressions for the distribution of irreducible representations in the moonshine module V ♮ = ⨁ n V n ♮ V^\natural = \bigoplus _n V_n^\natural . Their results show that as n n tends to infinity, V n ♮ V_n^\natural is dominated by direct sums of copies of the regular representation. That is, if we view V n ♮ V_n^\natural as a module over the group ring Z [ M ] \mathbb {Z}[\mathbb {M}] , the free part dominates. A natural problem, posed at the end of the aforementioned paper, is to characterize the distribution of irreducible representations in the non-free part. Here, we study asymptotic formulas for the coefficients of McKay-Thompson series to answer this question. We arrive at an ordering of the series by the magnitude of their coefficients, which corresponds to various contributions to the distribution. In particular, we show how the asymptotic distribution of the non-free part is dictated by the column for conjugacy class 2A in the monster’s character table. We find analogous results for the other monster modules V ( − m ) V^{(-m)} and W ♮ W^\natural studied by Duncan, Griffin, and Ono.

Fix an alphabet $A=\{0,1,\dots,M\}$ with $M\in\mathbb{N}$. The univoque set $\mathscr{U}$ of bases $q\in(1,M+1)$ in which the number $1$ has a unique expansion over the alphabet $A$ has been well studied. It has Lebesgue measure zero but Hausdorff dimension one. This paper investigates how the set $\mathscr{U}$ is distributed over the interval $(1,M+1)$ by determining the limit $$f(q):=\lim_{\delta\to 0}\dim_H\big(\mathscr{U}\cap(q-\delta,q+\delta)\big)$$ for all $q\in(1,M+1)$. We show in particular that $f(q)>0$ if and only if $q\in\overline{\mathscr{U}}\backslash\mathscr{C}$, where $\mathscr{C}$ is an uncountable set of Hausdorff dimension zero, and $f$ is continuous at those (and only those) points where it vanishes. Furthermore, we introduce a countable family of pairwise disjoint subsets of $\mathscr{U}$ called {\emph relative bifurcation sets}, and use them to give an explicit expression for the Hausdorff dimension of the intersection of $\mathscr{U}$ with any interval, answering a question of Kalle et al.~[{\emph arXiv:1612.07982; to appear in Acta Arithmetica}, 2018]. Finally, the methods developed in this paper are used to give a complete answer to a question of the first author [{\emph Adv. Math.}, 308:575--598, 2017] about strongly univoque sets., Comment: 31 pages and 1 figure

In a recent paper, Oliver Riordan shows that for $r \ge 4$ and $p$ up to and slightly larger than the threshold for a $K_r$-factor, the hypergraph formed by the copies of $K_r$ in $G(n,p)$ contains a copy of the binomial random hypergraph $H=H_r(n,\pi)$ with $\pi \sim p^{r \choose 2}$. For $r=3$, he gives a slightly weaker result where the density in the random hypergraph is reduced by a constant factor. Recently, Jeff Kahn announced an asymptotically sharp bound for the threshold in Shamir's hypergraph matching problem for all $r \ge 3$. With Riordan's result, this immediately implies an asymptotically sharp bound for the threshold of a $K_r$-factor in $G(n,p)$ for $r \ge 4$. In this note, we resolve the missing case $r=3$ by modifying Riordan's argument. This means that Kahn's result also implies a sharp bound for triangle factors in $G(n,p)$., Comment: 4 pages; minor corrections, and updated references to new version of Oliver Riordan's paper

We investigate generalised polynomials (i.e. polynomial-like expressions involving the use of the floor function) which take the value $0$ on all integers except for a set of density $0$. Our main result is that the set of integers where a sparse generalised polynomial takes non-zero value cannot contain a translate of an IP set. We also study some explicit constructions, and show that the characteristic functions of the Fibonacci and Tribonacci numbers are given by generalised polynomails. Finally, we show that any sufficiently sparse $\{0,1\}$-valued sequence is given by a generalised polynomial. (This paper is essentially the first half of our earlier submission arXiv:1610.03900 [math.NT]. Because the material in arXiv:1610.03900 [math.NT] touches upon many different subjects, we believe it is preferable to split it into two independent papers.), 28 pages. arXiv admin note: substantial text overlap with arXiv:1610.03900

The main inspiration for this paper is a paper by Elek where he introduces combinatorial cost for graph sequences. We show that having cost equal to 1 and hyperfiniteness are coarse invariants. We also show `cost-1' for box spaces behaves multiplicatively when taking subgroups. We show that graph sequences coming from Farber sequences of a group have property A if and only if the group is amenable. The same is true for hyperfiniteness. This generalises a theorem by Elek. Furthermore we optimise this result when Farber sequences are replaced by sofic approximations. In doing so we introduce a new concept: property almost-A., 20 pages. Comments welcome

In a highly influential paper, Bidigare, Hanlon and Rockmore showed that a number of popular Markov chains are random walks on the faces of a hyperplane arrangement. Their analysis of these Markov chains took advantage of the monoid structure on the set of faces. This theory was later extended by Brown to a larger class of monoids called left regular bands. In both cases, the representation theory of these monoids played a prominent role. In particular, it was used to compute the spectrum of the transition operators of the Markov chains and to prove diagonalizability of the transition operators. In this paper, we establish a close connection between algebraic and combinatorial invariants of a left regular band: we show that certain homological invariants of the algebra of a left regular band coincide with the cohomology of order complexes of posets naturally associated to the left regular band. For instance, we show that the global dimension of these algebras is bounded above by the Leray number of the associated order complex. Conversely, we associate to every flag complex a left regular band whose algebra has global dimension precisely the Leray number of the flag complex., Comment: Appendix removed

Let $X,X_1,\ldots,X_n$ be independent identically distributed random variables. The paper deals with the question about the behavior of the concentration function of the random variable $\sum\limits_{k=1}^{n}X_k a_k$ according to the arithmetic structure of vectors $a_k$. Recently, the interest to this question has increased significantly due to the study of distributions of eigenvalues of random matrices. In this paper we formulate and prove multidimensional generalizations of the results Eliseeva and Zaitsev (2012). They are also the refinements of the results of Friedland and Sodin (2007) and Rudelson and Vershynin (2009)., Comment: 13 pages

The chromatic threshold $\delta_\chi(H,p)$ of a graph $H$ with respect to the random graph $G(n,p)$ is the infimum over $d > 0$ such that the following holds with high probability: the family of $H$-free graphs $G \subset G(n,p)$ with minimum degree $\delta(G) \ge dpn$ has bounded chromatic number. The study of the parameter $\delta_\chi(H) := \delta_\chi(H,1)$ was initiated in 1973 by Erd\H{o}s and Simonovits, and was recently determined for all graphs $H$. In this paper we show that $\delta_\chi(H,p) = \delta_\chi(H)$ for all fixed $p \in (0,1)$, but that typically $\delta_\chi(H,p) \ne \delta_\chi(H)$ if $p = o(1)$. We also make significant progress towards determining $\delta_\chi(H,p)$ for all graphs $H$ in the range $p = n^{-o(1)}$. In sparser random graphs the problem is somewhat more complicated, and is studied in a separate paper., Comment: 36 pages (including appendix), 1 figure; the appendix is copied with minor modifications from arXiv:1108.1746 for a self-contained proof of a technical lemma; accepted to Random Structures and Algorithms

In this paper, we prove that the weighted BMO space as follows $${\rm BMO}^{p}(\omega)=\Big\{f\in L^{1}_{\rm loc}:\sup_{Q}\|\chi_{Q}\|^{-1}_{L^{p}(\omega)}\big\|(f-f_{Q})\omega^{-1}\chi_{Q}\big\|_{L^{p}(\omega)}, Comment: Recently, Jarod Hart and Rodolfo H. Torres(arXiv:1707.01141) obtained some characterizations of weighted BMO space, Theorem 1.2 in my paper can be seem as a corollary of Theorem 5.9 in their paper. It should point out that our paper has submitted to Forum Mathematicum on 18-Apr-2017

We prove that knots obtained by attaching a band to a split link satisfy the cabling conjecture. We also give new proofs that unknotting number one knots are prime and that genus is superadditive under band sum. Additionally, we prove a collection of results comparing two 2-handle additions to a genus two boundary component of a compact, orientable 3-manifold. These results give a near complete solution to a conjecture of Scharlemann and provide evidence for a conjecture of Scharlemann and Wu. The proofs make use of a new theorem concerning the effects of attaching a 2-handle to a suture in the boundary of a sutured manifold., Paper completely rewritten. Main sutured manifold theory results have been moved to a separate paper

Let $2 \leq a \leq b \leq c \in \mathbb{N}$ with $��=1/a+1/b+1/c$ be the corresponding hyperbolic triangle group. Many papers have been dedicated to the following question: what are the finite (simple) groups which appear as quotients of $T$? (Classically, for $(a,b,c)=(2,3,7)$ and more recently also for general $(a,b,c)$.) These papers have used either explicit constructive methods or probabilistic ones. The goal of this paper is to present a new approach based on the theory of representation varieties (via deformation theory). As a corollary we essentially prove a conjecture of Marion [21] showing that various finite simple groups are not quotients of $T$, as well as positive results showing that many finite simple groups are quotients of $T$.

We investigate the ratio asymptotic behavior of the sequence $(Q_{n})_{n=0}^{\infty}$ of multiple orthogonal polynomials associated with a Nikishin system of $p\geq 1$ measures that are compactly supported on the star-like set of $p+1$ rays $S_{+}=\{z\in\mathbb{C}: z^{p+1}\geq 0\}$. The main algebraic property of these polynomials is that they satisfy a three-term recurrence relation of the form $zQ_{n}(z)=Q_{n+1}(z)+a_{n} Q_{n-p}(z)$ with $a_{n}>0$ for all $n\geq p$. Under a Rakhmanov-type condition on the measures generating the Nikishin system, we prove that the sequence of ratios $Q_{n+1}(z)/Q_{n}(z)$ and the sequence $a_{n}$ of recurrence coefficients are limit periodic with period $p(p+1)$. Our results complement some results obtained by the first author and Mi\~{n}a-D\'{i}az in a recent paper in which algebraic properties and weak asymptotics of these polynomials were investigated. Our results also extend some results obtained by the first author in the case $p=2$., Comment: Minor corrections were done for this version. A continuation of this work is in arXiv: 1907.03002. This paper has 37 pages, 1 table, no figures

The purpose of this paper has twofold. The first is to establish a second main theorem with truncated counting functions for algebraically nondegenerate meromorphic mappings into an arbitrary projective variety intersecting a family of hypersurfaces in subgeneral position. In our result, the truncation level of the counting functions is estimated explicitly. Our result is an extension of the classical second main theorem of H. Cartan, also is a generalization of the recent second main theorem of M. Ru and improves some recent results. The second purpose of this paper is to give another proof for the second main theorem for the special case where the projective variety is a projective space, by which the truncation level of the counting functions is estimated better than that of the general case., This paper is accepted for publication in Transactions of the American Mathematical Society

The question of which functions acting entrywise preserve positive semidefiniteness has a long history, beginning with the Schur product theorem [Crelle 1911], which implies that absolutely monotonic functions (i.e., power series with nonnegative coefficients) preserve positivity on matrices of all dimensions. A famous result of Schoenberg and of Rudin [Duke Math. J. 1942, 1959] shows the converse: there are no other such functions. Motivated by modern applications, Guillot and Rajaratnam [Trans. Amer. Math. Soc. 2015] classified the entrywise positivity preservers in all dimensions, which act only on the off-diagonal entries. These two results are at "opposite ends", and in both cases the preservers have to be absolutely monotonic. We complete the classification of positivity preservers that act entrywise except on specified "diagonal/principal blocks", in every case other than the two above. (In fact we achieve this in a more general framework.) This yields the first examples of dimension-free entrywise positivity preservers - with certain forbidden principal blocks - that are not absolutely monotonic., Minor edits in exposition, 19 pages. The paper now uses the style file of Trans. AMS (to appear)

In an earlier paper (arxiv:1108.4292) we introduced a new concept of dimension for metric spaces, the so called topological Hausdorff dimension. For a compact metric space $K$ let $\dim_{H}K$ and $\dim_{tH} K$ denote its Hausdorff and topological Hausdorff dimension, respectively. We proved that this new dimension describes the Hausdorff dimension of the level sets of the generic continuous function on $K$, namely $\sup{\dim_{H}f^{-1}(y) : y \in \mathbb{R}} = \dim_{tH} K - 1$ for the generic $f \in C(K)$, provided that $K$ is not totally disconnected, otherwise every non-empty level set is a singleton. We also proved that if $K$ is not totally disconnected and sufficiently homogeneous then $\dim_{H}f^{-1}(y) = \dim_{tH} K - 1$ for the generic $f \in C(K)$ and the generic $y \in f(K)$. The most important goal of this paper is to make these theorems more precise. As for the first result, we prove that the supremum is actually attained on the left hand side of the first equation above, and also show that there may only be a unique level set of maximal Hausdorff dimension. As for the second result, we characterize those compact metric spaces for which for the generic $f\in C(K)$ and the generic $y\in f(K)$ we have $\dim_{H} f^{-1}(y)=\dim_{tH}K-1$. We also generalize a result of B. Kirchheim by showing that if $K$ is self-similar then for the generic $f\in C(K)$ for every $y\in \inter f(K)$ we have $\dim_{H} f^{-1}(y)=\dim_{tH}K-1$. Finally, we prove that the graph of the generic $f\in C(K)$ has the same Hausdorff and topological Hausdorff dimension as $K$., 20 pages

We consider connectivity properties of certain i.i.d. random environments on i¾?d, where at each location some steps may not be available. Site percolation and oriented percolation are examples of such environments. In these models, one of the quantities most often studied is the random set of vertices that can be reached from the origin by following a connected path. More generally, for the models we consider, multiple different types of connectivity are of interest, including: the set of vertices that can be reached from the origin; the set of vertices from which the origin can be reached; the intersection of the two. As with percolation models, many of the models we consider admit, or are expected to admit phase transitions. Among the main results of the paper is a proof of the existence of phase transitions for some two-dimensional models that are non-monotone in their underlying parameter, and an improved bound on the critical value for oriented site percolation on the triangular lattice. The connectivity of the random directed graphs provides a foundation for understanding the asymptotic properties of random walks in these random environments, which we study in a second paper. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 45, 111-137, 2014

In this paper, we study the stability of catenoids and helicoids in the hyperbolic $3$-space $\mathbb{H}^3$. (1) For a family of spherical minimal catenoids $\{\mathcal{C}_a\}_{a>0}$ in $\mathbb{H}^3$, there exist two constants $0\bar{a}_c$., Comment: This paper replaces both arXiv:1204.4943 and arXiv:1502.04764

Let E S ( n ) ES(n) be the smallest integer such that any set of E S ( n ) ES(n) points in the plane in general position contains n n points in convex position. In their seminal 1935 paper, Erdős and Szekeres showed that E S ( n ) ≤ ( 2 n − 4 n − 2 ) + 1 = 4 n − o ( n ) ES(n) \leq {2n - 4\choose n-2} + 1 = 4^{n -o(n)} . In 1960, they showed that E S ( n ) ≥ 2 n − 2 + 1 ES(n) \geq 2^{n-2} + 1 and conjectured this to be optimal. In this paper, we nearly settle the Erdős-Szekeres conjecture by showing that E S ( n ) = 2 n + o ( n ) ES(n) =2^{n +o(n)} .

Inspired by work of McMullen, we show that any orbit of the diagonal group in the space of lattices accumulates on the set of stable lattices. As consequences, we settle a conjecture of Ramharter concerning the asymptotic behaviour of the Mordell constant, and reduce Minkowski's conjecture on products of linear forms to a geometric question, yielding two new proofs of the conjecture in dimensions up to 7., Comment: This paper was part of the paper "On stable lattices and the diagonal group" (arXiv:1309.4025) which was split into three shorter papers (now all on arXiv) following the referee's request

A recent paper of Shekhar compares the ranks of elliptic curves $E_1$ and $E_2$ for which there is an isomorphism $E_1[p] \simeq E_2[p]$ as $\mathrm{Gal}(\bar{\mathbf{Q}}/\mathbf{Q})$-modules, where $p$ is a prime of good ordinary reduction for both curves. In this paper we prove an analogous result in the case where $p$ is a prime of good supersingular reduction., Comment: fixed a persistent typo in the results of Section 3. this typo led to the original example for p=3 being incorrect; it has been replaced with a correct example

The category of framed correspondences $Fr_*(k)$ and framed sheaves were invented by Voevodsky in his unpublished notes [V2]. Based on the theory, framed motives are introduced and studied in [GP1]. These are Nisnivich sheaves of $S^1$-spectra and the major computational tool of [GP1]. The aim of this paper is to show the following result which is essential in proving the main theorem of [GP1]: given an infinite perfect base field $k$, any $k$-smooth scheme $X$ and any $n\geq 1$, the map of simplicial pointed Nisnevich sheaves $(-,\mathbb{A}^1//\mathbb G_m)^{\wedge n}_+\to T^n$ induces a Nisnevich local level weak equivalence of $S^1$-spectra $$M_{fr}(X\times (\mathbb{A}^1// \mathbb G_m)^{\wedge n})\to M_{fr}(X\times T^n).$$ Moreover, it is proven that the sequence of $S^1$-spectra $$M_{fr}(X \times T^n \times \mathbb G_m) \to M_{fr}(X \times T^n \times\mathbb A^1) \to M_{fr}(X \times T^{n+1})$$ is locally a homotopy cofiber sequence in the Nisnevich topology. Another important result of this paper shows that homology of framed motives is computed as linear framed motives in the sense of [GP1]. This computation is crucial for the whole machinery of framed motives [GP1]., Comment: This is the final revised version

In this paper we discuss a problem of generalization of binomial distributed triangle, that is sequence A287326 in OEIS. The main property of A287326 that it returns a perfect cube n as sum of n-th row terms over k, 0 or 1 , by means of its symmetry. In this paper we have derived a similar triangles in order to receive powers m=5,7 as row items sum and generalized obtained results in order to receive every odd-powered monomial n2m+1, m as sum of row terms of corresponding triangle. This version might be out of date, proceed by the link to see actual version., 16 pages, 8 figures, 2 tables, typos revised, added missing references, results generalized and shortened, derivations detailed.

In 1998, Kleinbock & Margulis established a conjecture of V.G. Sprindzuk in metrical Diophantine approximation (and indeed the stronger Baker-Sprindzuk conjecture). In essence the conjecture stated that the simultaneous homogeneous Diophantine exponent $w_{0}(\vv x) = 1/n$ for almost every point $\vv x$ on a non-degenerate submanifold $\cM$ of $\R^n$. In this paper the simultaneous inhomogeneous analogue of Sprindzuk's conjecture is established. More precisely, for any `inhomogeneous' vector $\bm\theta\in\R^n$ we prove that the simultaneous inhomogeneous Diophantine exponent $w_{0}(\vv x, \bm\theta)= 1/n$ for almost every point $\vv x$ on $M$. The key result is an inhomogeneous transference principle which enables us to deduce that the homogeneous exponent $w_0(\vv x)=1/n$ for almost all $\vv x\in \cM$ if and only if for any $\bm\theta\in\R^n$ the inhomogeneous exponent $w_0(\vv x,\bm\theta)=1/n$ for almost all $\vv x\in \cM$. The inhomogeneous transference principle introduced in this paper is an extremely simplified version of that recently discovered in \cite{Beresnevich-Velani-new-inhom}. Nevertheless, it should be emphasised that the simplified version has the great advantage of bringing to the forefront the main ideas of \cite{Beresnevich-Velani-new-inhom} while omitting the abstract and technical notions that come with describing the inhomogeneous transference principle in all its glory., Comment: Dedicated to A.O. Gelfond on what would have been his 100th birthday 13 pages

In this paper we construct explicitly a square integrable residual automorphic representation of the special orthogonal group $SO_{2n}$, through Eisenstein series. We show that this representation comes from an elliptic Arthur parameter $\psi$ and appears in the space $L^2(SO_{2n}(\mathbb{Q})\backslash SO_{2n}(\mathbb{A}_{\mathbb{Q}}))$ with multiplicity one. Next, we consider parameters whose Hecke matrices, at the unramified places, have eigenvalues bigger (in absolute value), than those of the parameter constructed before. The main result is, that these parameters cannot be cuspidal. We establish bounds for the eigenvalues of Hecke operators, as consequences of Arthur's conjectures for $SO_{2n}$. Next, we calculate the character and the twisted characters for the representations that we constructed. Finally, we find the composition of the global and local Arthur's packets associated to our parameter $\psi$. All the results in this paper are true if we replace $\mathbb{Q}$ by any number field $F$., Comment: 39 pages

As a first goal, it is explained why Goodwillie-Weiss calculus of embeddings offers new information about the Euclidean embedding dimension of P^m only for m < 16. Concrete scenarios are described in these low-dimensional cases, pinpointing where to look for potential, but critical, high-order obstructions in the corresponding Taylor towers. For m > 15, the relation TC^S(P^m) > n-1 is translated into the triviality of a certain cohomotopy Euler class which, in turn, becomes the only Taylor obstruction to producing an n-dimensional Euclidean embedding of P^m. A speculative bordism-type form of this primary obstruction is proposed as an analogue of Davis' BP-approach to the immersion problem of P^m. A form of the Euler class viewpoint is applied to show TC^S(P^3) = 5, as well as to suggest a few higher dimensional projective spaces for which the method could produce new information. As a second goal, the paper extends Farber's work on the motion planning problem in order to develop the notion of a symmetric motion planner for a mechanical system S. Following Farber's lead, this concept is connected to the symmetric topological complexity of the state space of S. The paper ends by sketching the construction of a concrete 5-local-rules symmetric motion planner for P^3., updated, final version to appear in Transactions of the American Mathematical Society