Related papers: Clouds in Higher Dimensions
Using the theory of resolving classes, we show that if $X$ is a CW complex of finite type such that $\map_*(X, S^{2n+1})\sim *$ for all sufficiently large $n$, then $\map_*(X, K) \sim *$ for every simply-connected finite-dimensional CW…
In order to account for the observable Universe, any comprehensive theory or model of cosmology must draw from many disciplines of physics, including gauge theories of strong and weak interactions, the hydrodynamics and microphysics of…
The higher Nash blowup of an algebraic variety replaces singular points with limits of certain spaces carrying higher-order data associated to the variety at non-singular points. In this note we will define a higher-order Jacobian matrix…
In today's information technology (IT) era, a major part of the costs is being spent on computational needs. Enterprises are in efforts to increase their Return on Investment (ROI) and individuals are trying to reduce their costs. In this…
Today, cloud computing is an emerging way of computing in computer science. Cloud computing is a set of resources and services that are offered by the network or internet. Cloud computing extends various computing techniques like grid…
Let P be a set of n points in the plane, not all on a line. We show that if n is large then there are at least n/2 ordinary lines, that is to say lines passing through exactly two points of P. This confirms, for large n, a conjecture of…
We study extensions of the classic \emph{Line Cover} problem, which asks whether a set of $n$ points in the plane can be covered using $k$ lines. Line Cover is known to be NP-hard, and we focus on two natural generalizations. The first is…
The evolution of the electron density during electron cloud formation can be reproduced using a bunch-to-bunch iterative map formalism. The reliability of this formalism has been proved for RHIC [1] and LHC [2]. The linear coefficient has a…
Gelfand - Na\u{i}mark theorem supplies a one to one correspondence between commutative $C^*$-algebras and locally compact Hausdorff spaces. So any noncommutative $C^*$-algebra can be regarded as a generalization of a topological space.…
In this paper, we study necessary and sufficient conditions for the existence of categorical universal coverings using open covers of a given space $X$. As some applications, first we present a generalized version of the Shelah Theorem…
Given a sphere of any radius $r$ in an $n$-dimensional Euclidean space, we study the coverings of this sphere with solid spheres of radius one. Our goal is to design a covering of the lowest covering density, which defines the average…
In this paper, we introduced some notions on the n-Normed Spaces. Those are bounded k-linear (or multilinear) functionals and k-continuous (or multicontinuous) functions with k \in \mathbb{N}. We defined k-linear functionals under several…
Let $S$ be a set of $n$ points in $\mathbb{R}^3$, no three collinear and not all coplanar. If at most $n-k$ are coplanar and $n$ is sufficiently large, the total number of planes determined is at least $1 + k…
Let us consider a sphere $S^{n-1}$ of radius $r$ in $\mathbb{R}^n$, where we have fixed poles $N$ and $S$. Suppose that $K$ is a set in $\mathbb{R}^n$ containing a translated copy of each meridian (that is an $S^{n-2}$-sphere) of $S^{n-1}$.…
The Press-Schechter(PS) formalism for the mass function of the collapsed objects are reanalyzed. The factor of two in the Press-Schechter formalism is argued to be correct in the sharp $k$-space filter even when we use the another approach…
The Cloud has become integral to most Internet-based applications and user gadgets. This article provides a brief history of the Cloud and presents a researcher's view of the prospects for innovating at the infrastructure, middleware, and…
We show that the minimal number of skewed hyperplanes that cover the hypercube $\{0,1\}^{n}$ is at least $\frac{n}{2}+1$, and there are infinitely many $n$'s when the hypercube can be covered with $n-\log_{2}(n)+1$ skewed hyperplanes. The…
An Euler tour in a hypergraph (also called a rank-2 universal cycle or 1-overlap cycle in the context of designs) is a closed walk that traverses every edge exactly once. In this paper, we define a covering $k$-hypergraph to be a non-empty…
We solve a problem posed by Cardinali and Sastry [2] about factorization of $2$-covers of finite classical generalized quadrangles. To that end, we develop a general theory of cover factorization for generalized quadrangles, and in…
We introduce a notion of curvature on finite, combinatorial graphs. It can be easily computed by solving a linear system of equations. We show that graphs with curvature bounded below by $K>0$ have diameter bounded by $\mbox{diam}(G) \leq…