相关论文: Rationality and computability of the covering radi…

We compute the number of equivalence classes of nonperiodic covering cycles of given length in a non oriented connected graph. A covering cycle is a closed path that traverses each edge of the graph at least once. A special case is the…

A general greedy approach to construct coverings of compact metric spaces by metric balls is given and analyzed. The analysis is a continuous version of Chvatal's analysis of the greedy algorithm for the weighted set cover problem. The…

We introduce a variant of the cover time of a graph, called cover cost, in which the cost of a step is proportional to the number of yet uncovered vertices. It turns out that cover cost is more tractable than cover time; we provide an…

We give simple upper bounds for rational sectional category and use them to compute invariants of the type of Farber's topological complexity of rational spaces. In particular we show that the sectional category of formal morphisms reaches…

In this thesis, we introduce the fundamental equations behind the estimation of the link budget in a communications channel, highlighting the key limitations of conventional systems. Furthermore, we investigate the use of reconfigurable…

We give necessary and sufficient topological conditions for a simple closed curve on a real rational surface to be approximable by smooth rational curves. We also study approximation by smooth rational curves with given complex…

In this work we use arithmetic, geometric, and combinatorial techniques to compute the cohomology of Weil divisors of a special class of normal surfaces, the so-called rational ruled toric surfaces. These computations are used to study the…

As modern computing moves towards smaller devices and powerful cloud platforms, more and more computation is being delegated to powerful service providers. Interactive proofs are a widely-used model to design efficient protocols for…

Coverage is one of the main quality of service of a wirelessnetwork. $k$-coverage, that is to be covered simultaneously by $k$network nodes, is synonym of reliability and numerous applicationssuch as multiple site MIMO features, or…

It is still a challenging task of today to recognize the type of a given algebraic surface which is described only by its implicit representation. In~this paper we will investigate in more detail the case of canal surfaces that are often…

Given a code from a shift space to an irreducible sofic shift, any two of the following three conditions -- open, constant-to-one, (right or left) closing -- imply the third. If the range is not sofic, then the same result holds when…

It is known that every closed curve of length \leq 4 in R^n (n>0) can be surrounded by a sphere of radius 1, and that this is the best bound. Letting S denote the circle of circumference 4, with the arc-length metric, we here express this…

We already saw in [A1] that the space of dynamically marked rational maps can be identified to a subspace of the space of covers between trees of spheres on which there is a notion of convergence that makes it sequentially compact. In the…

We explore covert communication of qubits over the lossy thermal-noise bosonic channel, which is a quantum-mechanical model of many practical channels, including optical. Covert communication ensures that an adversary is unable to detect…

Covering-based rough set theory is an extension to classical rough set. The main purpose of this paper is to study covering rough sets from a topological point of view. The relationship among upper approximations based on topological spaces…

We solve the problem of computing characteristic numbers of rational space curves with a cusp, where there may or may not be a condition on the node. The solution is given in the form of effective recursions. We give explicit formulas when…

In this article, firstly, some simple and smoothness properties of the weighted numerical radius and the weighted Crawford number functions are investigated. Then, some generalization formulas for lower and upper bounds of the weighted…

We define a covering of a profinite graph to be a projective limit of a system of covering maps of finite graphs. With this notion of covering, we develop a covering theory for profinite graphs which is in many ways analogous to the…

We present a full pipeline for computing the medial axis transform of an arbitrary 2D shape. The instability of the medial axis transform is overcome by a pruning algorithm guided by a user-defined Hausdorff distance threshold. The stable…

We exhibit a smooth complex rational affine surface with uncountably many nonisomorphic real forms.