Results 11 to 20 of about 761,422 (315)
General Relativity and Gravitation, 2011 Forthcoming in General Relativity and ...
Belot, Gordon, Gordon Belot
openaire +4 more sources
The Journal of Symbolic Logic, 2022 AbstractWe study higher analogues of the classical independence number on $\omega $ . For $\kappa $ regular uncountable, we denote by $i(\kappa )$ the minimal size of a maximal $\kappa $ -independent family. We establish ZFC relations between $i(\kappa )$ and the standard higher analogues of some of the classical cardinal characteristics, e.g.,
Vera Fischer, Diana Carolina Montoya
openaire +3 more sources
Relating broadcast independence and independence [PDF]
Discrete Mathematics, 2019 An independent broadcast on a connected graph $G$ is a function $f:V(G)\to \mathbb{N}_0$ such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$, and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G$ within distance at most $f(x)$ from $x$.
Bessy, Stéphane, Rautenbach, Dieter
openaire +4 more sources
Independent events and independent experiments [PDF]
Proceedings of the American Mathematical Society, 1993 It is shown that independent events in a probability space with equally likely outcomes are isomorphic to events coming from independent experiments each with equally likely outcomes.
Baryshnikov, Yuliy M. +1 more
openaire +1 more source
Dependence and Independence [PDF]
Studia Logica, 2013 We introduce an atomic formula intuitively saying that given variables are independent from given other variables if a third set of variables is kept constant. We contrast this with dependence logic. We show that our independence atom gives rise to a natural logic capable of formalizing basic intuitions about independence and dependence.
Erich Grädel, Jouko A. Väänänen
openaire +6 more sources
Archive for Mathematical Logic, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vera Fischer, Diana Carolina Montoya
openaire +2 more sources
On Independence Domination [PDF]
, 2013 Let G be a graph. The independence-domination number is the maximum over all independent sets I in G of the minimal number of vertices needed to dominate I. In this paper we investigate the computational complexity of independence domination for graphs in several graph classes related to cographs. We present an exact exponential algorithm.
Wing-Kai Hon +4 more
openaire +2 more sources
Independence of Independent Directors
International Journal For Multidisciplinary Research, 2023 INTRODUCTION A company is a legal entity of its own, but being an artificial person, they also constitute a body for controlling their affairs, which are the board of directors. A board of directors is the governing body of a company, whose members are elected by shareholders (in the case of public companies) to set strategy, oversee management, and ...
Abirami V -, Tejaswini S -
openaire +1 more source
BMC Public Health, 2019 Background This study explored the relationship between community social capital and cognitive impairment, with a focus on the buffering role of community social capital in the association between educational disadvantage and cognitive impairment in ...
Hiroshi Murayama +7 more
doaj +1 more source
Pilot and Feasibility Studies, 2020 Background The life expectancy for people with sickle cell disease (SCD) has improved tremendously over the last 50 years. This population experiences hemolysis and vaso-occlusion in multiple organs that lead to complications such as cardiopulmonary ...
Charity I. Oyedeji +4 more
doaj +1 more source