Results 51 to 60 of about 114 (106)
$\omega$ -cover and related spaces on the vietoris hyperspace $\mathcal F(X)$
Recently, Tuyen et al. [1] showed that a space has a $\sigma$-(P)-strong network consisting of cs-covers (resp., $cs^*$-covers) if and only if the hyperspace $\mathcal F(X)$ does, where is one of the following properties: point finite, point countable,
Nguyen Xuan Truc +3 more
doaj +1 more source
ABSTRACT The critical micelle concentration (CMC) values of the cationic gemini surfactant pentadiyl‐α,ω‐bis(dimethyldodecylammonium) bromide depend on the hydrophobicity of added conjugated organic carboxylate anions. Nine conjugated counterions, present as sodium salts of organic acids, were studied to expand the correlation to the counterion ...
Alexia Rios +4 more
wiley +1 more source
ABSTRACT Elite male football players have high peak fat oxidation (PFO), and recently PFO was reported to increase following preseason (PS) training in semi‐professional male players. Whether PFO increases from PS to competitive season (CS) in elite male football players remains unknown.
Tue Rømer +12 more
wiley +1 more source
Identifiability of points and rigidity of hypergraphs under algebraic constraints
Abstract The identifiability problem arises naturally in a number of contexts in mathematics and computer science. Specific instances include local or global rigidity of graphs and unique completability of partially‐filled tensors subject to rank conditions.
James Cruickshank +3 more
wiley +1 more source
This paper introduces a novel framework by merging the concepts of non-Archimedean generalized Menger spaces and (ϰ−ϝ)-weak proximal contractions. Extending the best proximity point concept to a triple of sets, we establish new existence theorems for ...
Lahcen Oumertou +5 more
doaj +1 more source
A menger-like property of tree-width: The finite case
The notion of tree-width was introduced by Robertson and Seymour. A graph has tree-width \(\leq w\) if it admits a tree-decomposition of tree-width \(\leq w\). We prove here that if \(G\) is finite and has tree-width \(\leq w\) then it admits a tree-decomposition of tree-width \(\leq w\) which satisfies a certain Menger-like condition.
openaire +3 more sources
Privacy as a Defense Against Premature Representation
Journal of Social Philosophy, EarlyView.
Jordan Wallace‐Wolf
wiley +1 more source
Este artículo propone un diálogo entre la teoría del orígen de la moneda de C. Menger (1871) y los modelos contemporáneos de búsqueda. Este ejercício permite poner en evidencia los limítes de la teoría que pretende explicar la moneda a partir de la ...
Alvarez Carlos Andrés
doaj
ABSTRACT Background Advances in transcriptomics have driven the demand for minimally invasive, reproducible and high‐yield skin sampling methods, particularly for studying inflammatory skin diseases in companion animals. Hypothesis/Objectives We tested tolerability, feasibility and RNA quantity and quality of three minimally invasive skin sampling ...
Ina Herrmann +2 more
wiley +1 more source
Este artículo propone un diálogo entre la teoria del origen de la moneda de C. Menger (1871) y los modelos contemporáneos de búsqueda. Este ejercicio permi te poner en evidencia los limi tes de la teoría que pretende explicar la moneda a partir de la ...
Andrés Alvarez
doaj

