Related papers: Rationality and computability of the covering radi…
We consider the problem of covering an input graph $H$ with graphs from a fixed covering class $G$. The classical covering number of $H$ with respect to $G$ is the minimum number of graphs from $G$ needed to cover the edges of $H$ without…
Because the stochastic calculus yields rarely random variables with laws defined by explicit closed formulas, probabilistic numerical computations are done most often by simulation. The simulation by the shift, whose field of application is…
A covering code is a set of codewords with the property that the union of balls, suitably defined, around these codewords covers an entire space. Generally, the goal is to find the covering code with the minimum size codebook. While most…
Recent works have explored the use of counting queries coupled with Description Logic ontologies. The answer to such a query in a model of a knowledge base is either an integer or $\infty$, and its spectrum is the set of its answers over…
The paper addresses the problem of locating sensors with a circular field of view so that a given line segment is under full surveillance, which is termed as the Disc Covering Problem on a Line. The cost of each sensor includes a fixed…
The cover time of a finite connected graph is the expected number of steps needed for a simple random walk on the graph to visit all the vertices. It is known that the cover time on any n-vertex, connected graph is at least (1+o(1)) n…
Spatial computing is a technological advancement that facilitates the seamless integration of devices into the physical environment, resulting in a more natural and intuitive digital world user experience. Spatial computing has the…
We prove that the Euler-Chow series for ruled surfaces and scrolls is rational by means of an explicit computation.
We study maps of the unit interval whose graph is made up of two increasing segments and which are injective in an extended sense. Such maps $f_{\p}$ are parametrized by a quintuple $\p$ of real numbers satisfying inequations. Viewing…
This paper studies the performance of a single-input single-output (SISO) system enhanced by the assistance of an intelligent reflecting surface (IRS), which is equipped with a finite number of elements under Rayleigh fading channels. From…
In this article, we define the notion of slim (normal) bases and show their existence for various fields. As an application, an algorithm will be given that computes the spectrum of a basefield transform by merely using O(n) additions.
We prove a quantitative upper bound on the filling radius of complete, spin manifolds with uniformly positive scalar curvature using the quantitative operator $K$-theory and index theory.
Covering relations are a topological tool for detecting periodic orbits, symbolic dynamics and chaotic behavior for autonomous ODE. We extend the method of the covering relations onto systems with a time dependent perturbation. As an…
Solutions to optimization problems involving the numerical radius often belong to a special class: the set of matrices having field of values a disk centered at the origin. After illustrating this phenomenon with some examples, we…
We consider the problem of a sphere rolling of a curved surface and solve it by mapping it to the precession of a spin 1/2 in a magnetic field of variable magnitude and direction. The mapping can be of pedagogical use in discussing both…
We give an upper bound for the degree of rational curves in a family that covers a given birational ruled surface in projective space. The upper bound is stated in terms of the degree, sectional genus and arithmetic genus of the surface. We…
A covering array $\mathsf{CA}(N;t,k,v)$ is an $N\times k$ array with entries in $\{1, 2, \ldots , v\}$, for which every $N\times t$ subarray contains each $t$-tuple of $\{1, 2, \ldots , v\}^t$ among its rows. Covering arrays find…
We improve a bound due to the second author on number of rational points on smooth surfaces in $\mathbb{P}^3$ over finite fields and look at families of surfaces that achieve or nearly achieve this bound, for which we compute their exact…
We study real double covers of $\mathbb P^1\times\mathbb P^2$ branched over a $(2,2)$-divisor, which have the structure of a conic bundle threefold with smooth quartic discriminant curve via the second projection. In each isotopy class of…
It does a revision about the physical principles involved in digital processing of satellite images, more specifically in radiometric calibration of them. It shows a conceptual description of the interaction between radiation and atmosphere…