Substances restricted under REACH - ECHA
Substances restricted under REACH The list of substances restricted under REACH will be available in our new chemicals database, ECHA CHEM, since 16 September 2025. To guarantee a smooth …
Substances restricted under REACH The list of substances restricted under REACH will be available in our new chemicals database, ECHA CHEM, since 16 September 2025. To guarantee a smooth …
Substances restricted under REACH The list of substances restricted under REACH will be available in our new chemicals database, ECHA CHEM, since 16 September 2025. To guarantee a smooth …
Substances restricted under REACH The list of substances restricted under REACH will be available in our new chemicals database, ECHA CHEM, since 16 September 2025. To guarantee a smooth …
Substances restricted under REACH The list of substances restricted under REACH will be available in our new chemicals database, ECHA CHEM, since 16 September 2025. To guarantee a smooth …
Substances restricted under REACH The list of substances restricted under REACH will be available in our new chemicals database, ECHA CHEM, since 16 September 2025. To guarantee a smooth …
Substances restricted under REACH The list of substances restricted under REACH will be available in our new chemicals database, ECHA CHEM, since 16 September 2025. To guarantee a smooth …
Substances restricted under REACH The list of substances restricted under REACH will be available in our new chemicals database, ECHA CHEM, since 16 September 2025. To guarantee a smooth …
Substances restricted under REACH The list of substances restricted under REACH will be available in our new chemicals database, ECHA CHEM, since 16 September 2025. To guarantee a smooth …
In this paper, we introduce restricted products for families of locally convex spaces and formulate criteria ensuring that mappings into such products are continuous or smooth. As a special case, can define restricted products of weighted function sp...
In this paper, we consider impartial and partizan restricted chocolate bar games. In impartial restricted chocolate bar games, players cut a chocolate bar into two pieces along any horizontal or vertical line and eat whichever piece is smaller. If th...
This paper introduces the Circular Restricted n-Body Problem (CRNBP), an extension of the bicircular restricted four-body problem (BCR4BP) designed to describe the dynamics of an n-body system. In the CRNBP, each massive body in the system is constra...
Spiro, Surya and Zeng (Electron. J. Combin. 2023; arXiv:2207.11272) recently studied a semi-restricted variant of the well-known game Rock, Paper, Scissors; in this variant the game is played for $3n$ rounds, but one of the two players is restricted...
By distinguishing the main arc Fraternite from the minor arcs Egalite (2,1), Liberte, Courage, the restricted three-body system is extended to a non-conservative restricted four-body system with the central body Neptune S, the primary body Galatea X,...
Neural networks have been recently proposed as variational wave functions for quantum many-body systems [G. Carleo and M. Troyer, Science 355, 602 (2017)]. In this work, we focus on a specific architecture, known as Restricted Boltzmann Machine (RBM)...
A bijection is constructed between two sets of height restricted lattice paths by means of translating them in two tree classe, namely plane trees and Elena trees. An old bijection between them can be used now for that actual problem....
This work considers lattice walks restricted to the quarter plane, with steps taken from a set of cardinality three. We present a complete classification of the generating functions of these walks with respect to the classes algebraic, transcendent...
We introduce a framework for obtaining tight mixing times for Markov chains based on what we call restricted modified log-Sobolev inequalities. Modified log-Sobolev inequalities (MLSI) quantify the rate of relative entropy contraction for the Markov...
Tree-width and path-width are widely successful concepts. Many NP-hard problems have efficient solutions when restricted to graphs of bounded tree-width. Many efficient algorithms are based on a tree decomposition. Sometimes the more restricted path...
We apply the techniques developed by Marcus, Spielman and Srivastava, working with principal submatrices in place of rank $1$ decompositions to give an alternate proof of their results on restricted invertibility. We show that one can find well condi...
For finite subsets A_1,...,A_n of a field, their sumset is given by {a_1+...+a_n: a_1 in A_1,...,a_n in A_n}. In this paper we study various restricted sumsets of A_1,...,A_n with restrictions of the following forms: a_i-a_j not in S_{ij}, or alpha...