Results 151 to 160 of about 207,710 (268)
Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths. [PDF]
Bentert M, Fomin FV, Golovach PA.
europepmc +1 more source
ABSTRACT This paper examines the impact of trade liberalisation on income inequality across 24 Sub‐Saharan African (SSA) countries from 2000 to 2020. Using IV‐Tobit and 2SLS models, we consistently find that greater trade openness significantly exacerbates inequality in the region. Critically, we document an inverted U‐shaped relationship between trade
Guivis Zeufack Nkemgha +2 more
wiley +1 more source
ABSTRACT Most in vitro toxicological research investigating the effects of inhaled compounds employ short‐term exposures of a couple of hours, or repeated, intermittent exposures for a limited number of days with exposure free periods, whereas in reality, we are continuously exposed, albeit to variable concentrations.
Marcia M. Oldenburger +4 more
wiley +1 more source
Factorization norms and an inverse theorem for MaxCut. [PDF]
Balla I, Hambardzumyan L, Tomon I.
europepmc +1 more source
ABSTRACT In this paper, we study and characterise the natural embedding of the twisted triality hexagon T ( q 3 , q ) ${\mathsf{T}}({q}^{3},q)$ in PG ( 7 , q 3 ) ${\mathsf{PG}}(7,{q}^{3})$. We begin by describing the possible intersections of subspaces of PG ( 7 , q 3 ) ${\mathsf{PG}}(7,{q}^{3})$ with T ( q 3 , q ) ${\mathsf{T}}({q}^{3},q)$.
Sebastian Petit, Geertrui Van de Voorde
wiley +1 more source
Symmetric and Antisymmetric Quantum States from Graph Structure and Orientation. [PDF]
de Jesus MR, Hoefel EOC, Angelo RM.
europepmc +1 more source
On Kotzig's Perfect Set Problem of Hamiltonian Cycle Decompositions of the Complete Graph
ABSTRACT A Hamiltonian cycle decomposition (HCD) of K n ${K}_{n}$ is a set of Hamiltonian cycles in which each 1‐path of K n ${K}_{n}$ appears exactly once. A Dudeney set of K n ${K}_{n}$ is a set of Hamiltonian cycles in which each 2‐path of K n ${K}_{n}$ appears exactly once.
Nobuaki Mutoh
wiley +1 more source
Spaces and sequences in the hippocampus: a homological perspective. [PDF]
Babichev A, Vashin V, Dabaghian Y.
europepmc +1 more source
Colourings of Uniform Group Divisible Designs and Maximum Packings
ABSTRACT A weak c $c$‐colouring of a design is an assignment of colours to its points from a set of c $c$ available colours, such that there are no monochromatic blocks. A colouring of a design is block‐equitable, if for each block, the number of points coloured with any available pair of colours differ by at most one.
Andrea C. Burgess +6 more
wiley +1 more source
GFD analysis for BRE zeolite graph through reverse degree and reverse neighborhood degree based topological descriptors. [PDF]
Yogalakshmi K +4 more
europepmc +1 more source

