Buscar
Mostrando ítems 211-220 de 671
Artículo
Testing the Logarithmic Comparison Theorem for Free Divisors
(Taylor and Francis, 2004)
Artículo
On the finiteness of some n-color Rado numbers
(Elsevier, 2017)
For integers k, n, c with k, n ≥ 1, the n-color Rado number Rk(n, c) is defined to be the least integer N if any, or infinity otherwise, such that for every n-coloring of the set {1, 2, . . . , N}, there exists a ...
Artículo
Cover Contact Graphs
(2007)
We study problems that arise in the context of covering certain geometric objects (so-called seeds, e.g., points or disks) by a set of other geometric objects (a so-called cover, e.g., a set of disks or homothetic triangles). ...
Artículo
An algebraic approach to Integer Portfolio problems
(2011-05-01)
Integer variables allow the treatment of some portfolio optimization problems in a more realistic way and introduce the possibility of adding some natural features to the model. We propose an algebraic approach to ...
Artículo
A vanishing theorem for a class of logarithmic D-modules
(Cornell University, 2007)
Let OX (resp. DX) be the sheaf of holomorphic functions (resp. the sheaf of linear differential operators with holomorphic coefficients) on X = Cn. Let D X be a locally weakly quasi-homogeneous free divisor defined by ...
Artículo
Industrial Steel Heat Treating: Numerical Simulation of Induction Heating and Aquaquenching Cooling with Mechanical Effects
(MDPI, 2021)
This paper summarizes a mathematical model for the industrial heating and cooling processes of a steel workpiece corresponding to the steering rack of an automobile. The general purpose of the heat treatment process is ...
Artículo
GA Based Robust Blind Digital Watermarking
(Elsevier, 2018)
A genetic algorithm based robust blind digital watermarking scheme is presented. The experimental results show that our scheme keeps invisibility, security and robustness more likely than other proposals in the literature, ...
Artículo
Locating a Central Hunter on the Plane
(Springer, 2007)
Protection, surveillance or other types of coverage services of mobile points call for different, asymmetric distance measures than the traditional Euclidean, rectangular or other norms used for fixed points. In this ...
Artículo
On the growth of the Kronecker coefficients: accompanying appendices
(Cornell University, 2016)
This text is an appendix to our work ”On the growth of Kronecker coefficients” [1]. Here, we provide some complementary theorems, re- marks, and calculations that for the sake of space are not going to appear into the ...
Artículo
Toughness of the corona of two graphs
(Taylor and Francis, 2011)
The toughness of a non-complete graph G = (V , E) is defined as τ (G) = min{|S|/ω(G − S)}, where the minimum is taken over all cutsets S of vertices of G and ω(G − S) denotes the number of components of the resultant ...