Related papers: Embedding Unicritical Connectedness Loci
Network embedding is a highly effective method to learn low-dimensional node vector representations with original network structures being well preserved. However, existing network embedding algorithms are mostly developed for a single…
We establish a generic form of hardness amplification for the approximability of constant-depth Boolean circuits by polynomials. Specifically, we show that if a Boolean circuit cannot be pointwise approximated by low-degree polynomials to…
We extend the results of B. Minemyer by showing that any indefinite metric polyhedron (either compact or not) with the vertex degree bounded from above admits an isometric simplicial embedding into a Minkowski space of the lowest possible…
We give a sufficient condition for a projective metric on a subset of a Euclidean space to admit a bi-Lipschitz embedding into Euclidean space of the same dimension.
One of the main questions in the field of complex dynamics is the question whether the Mandelbrot set is locally connected, and related to this, for which maps the Julia set is locally connected. In this paper we shall prove the following…
Let $ G=(V,E) $ be a simple graph of order $ n $ and size $ m $. A connected edge cover set of a graph is a subset $S$ of edges such that every vertex of the graph is incident to at least one edge of $S$ and the subgraph induced by $S$ is…
One of the earliest conjectures in computational learning theory-the Sample Compression conjecture-asserts that concept classes (equivalently set systems) admit compression schemes of size linear in their VC dimension. To-date this…
We consider the set of monic degree $d$ real univariate polynomials $Q_d=x^d+\sum_{j=0}^{d-1}a_jx^j$ and its {\em hyperbolicity domain} $\Pi_d$, i.e. the subset of values of the coefficients $a_j$ for which the polynomial $Q_d$ has all…
We address the Uniform Boundedness Conjecture of Morton and Silverman in the case of unicritical polynomials, assuming a generalization of the $abc$-conjecture. For unicritical polynomials of degree at least five, we require only the…
We establish effective bounds on the number of periodic points of degree-$d$ polynomials $\phi$ defined over $p$-adic fields and number fields, under a mild reduction hypothesis that is satisfied by all unicritical polynomials $X^d + c$…
A Fibonacci string is a length n binary string containing no two consecutive 1s. Fibonacci cubes (FC), Extended Fibonacci cubes (ELC) and Lucas cubes (LC) are subgraphs of hypercube defined in terms of Fibonacci strings. All these cubes…
We identify the complex plane C with the open unit disc D={z:|z|<1} by the homeomorphism z --> z/(1+|z|). This leads to a compactification $\bar{C}$ of C, homeomorphic to the closed unit disc. The Euclidean metric on the closed unit disc…
We consider, for complete bipartite graphs, the convex hulls of characteristic vectors of all matchings, extended by a binary entry indicating whether the matching contains two specific edges. These polytopes are associated to the quadratic…
We give elementary proofs of some congruence criteria to compute binomial coefficients in modulo a prime. These criteria are analogues to the symmetry property of binomial coefficients. We give extended version of Lucas Theorem by using…
We present a Monte Carlo study of the bond and site directed (oriented) percolation models in $(d+1)$ dimensions on simple-cubic and body-centered-cubic lattices, with $2 \leq d \leq 7$. A dimensionless ratio is defined, and an analysis of…
We establish the equidistribution with respect to the bifurcation measure of post-critically finite maps in any one-dimensional algebraic family of unicritical polynomials. Using this equidistribution result, together with a combinatorial…
Any symmetric affinity function $w: V\times V \to \mathbb{R}_+$ defined on a discrete set $V$ induces Euclidean space structure on $V$. In particular, an undirected graph specified by an affinity (or adjacency) matrix can be considered as a…
For a fixed integer $d$, we study here the locus of degree $d$ hypersurfaces $X$ in $\mathbb{P}^{2n+1}$ such that $H^{2n}(X,\mathbb{Q}) \cap H^{n,n}(X,\mathbb{C}) \not= \mathbb{Q}$. We call this locus \textit{the Noether-Lefschetz locus}.…
We consider Lipschitz percolation in $d+1$ dimensions above planes tilted by an angle $\gamma$ along one or several coordinate axes. In particular, we are interested in the asymptotics of the critical probability as $d \to \infty$ as well…
In this paper we construct a class of bounded degree bipartite graphs with a small separator and large bandwidth. Furthermore, we also prove that graphs from this class are spanning subgraphs of graphs with minimum degree just slightly…