I'll be back on the site again but this time if I need to go back as reference as well as if I get rusty in my career. Maria03-26-25 - AB, Canada I found Jenn's videos near the end of my discrete math class, so I only had a month to go through all of her discrete math...
These properties apply in combination with laws of algebra of sets to create easier calculations. What are the laws of algebra of sets? Laws of algebra of sets are many but here are the main four: Union of Sets, Intersection of Sets, Complement of Sets, Difference of Sets. As operations,...
Discrete & Computational Geometry Aims and scope Submit manuscript Barnabás Janzer 843 Accesses Explore all metrics Abstract Let K be a convex body (a compact convex set) in , that contains a copy of another body S in every possible orientation. Is it always possible to continuously move any...
R. Precup, Discrete continuation method for boundary value problems on bounded sets in Banach spaces, J. Comput. Appl. Math. 113(2000), 267-281.R. Precup, Discrete continuation method for boundary value problems on bounded sets in Banach spaces, Fixed Point Theory with Applications in ...
It is easy to guess that norming sets are very useful in computer calculations. One can see that the classical Markov inequality is not satisfied if E is a compact subset of an algebraic variety. However, also on algebraic sets we expect the consequences of (1) mentioned above. The ...
Moreover, we give a necessary and sufficient condition for the existence of efficient dominating sets in Cay(Zn,S) of order n=pkq,p2q2,pqr,p2qr,pqrs and degree |S|, where p,q,r,s are distinct primes, k is a positive integer, and |S|+1 is relatively prime to n|S|+1....
We use the continuous probability density function fK(k) equivalent to the discrete degree distribution and we define l(k9) as the expected number of nodes above a certain degree thresh- old k9: ð kmax lðk'Þ~ N fK ðkÞ dk: k' ð1Þ In the ''best case'', the ...
This paper presents a novel semi-automatic method for lung segmentation in thoracic CT datasets. The fully three-dimensional algorithm is based on a level set representation of an active surface and integrates texture features to improve its robustness. The method’s performance is enhanced by the ...
Erds etal. [P. Erds, T. Gallai, Zs. Tuza, Covering the cliques of a graph with vertices, Discrete Math. 108 (1992) 279–289] proposed to find sharp estimates on τC(G) for planar graphs. In this paper we first show that every outerplanar graph G of order n(≥2) has τC(G)...
Tomasz Schoen Department of Discrete Mathematics, Adam Mickiewicz University, Poznan, Poland Tomasz Schoen Corresponding author Correspondence to Vsevolod F. Lev. Additional information This author was partially supported by the Edmund Landau Center for Research in Mathematical Analysis and Related Areas, sp...