Results 71 to 80 of about 3,173 (190)
Spatial Statistics for Screening Molecular Structures
Deep architectures for materials discovery demand vast training data and obscure the structure‐property link. This review shows how spatial statistics offer a physically grounded alternative: voxelized fields and two‐point correlations, compressed by principal component analysis, yield convex, interpretable descriptors. Lean surrogates then reach sub‐2%
Pranoy Ray, Surya R. Kalidindi
wiley +1 more source
Against All Odds?—A Surprisingly Not So Easy Dice Game
ABSTRACT A game with 11 players, 2 dice, and simple rules. However, it turns out that the best strategy is not only absent from the literature, but that misconceptions about winning strategies also prevail among surveyed students. This makes it all the more surprising that it is not so easy to get to the bottom of the game mathematically.
Christoph Oberbucher +1 more
wiley +1 more source
International Journal of Mathematical Combinatorics, Vol.2A [PDF]
The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core +1 more source
Mixed Steiner Triple Systems With Shortest Length
ABSTRACT A mixed Steiner triple system is a 3‐GDD which is viewed as a code with minimum Hamming distance 3. These codes are the minimum weight codewords of a 1‐perfect code over a mixed alphabet, when the related codes exist, and provide the connection between 3‐GDDs and coding theory.
Tuvi Etzion
wiley +1 more source
International Journal of Mathematical Combinatorics, Vol.3 [PDF]
The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core +1 more source
The Recurrence Relations in Teaching Students of Informatics
The topic ``Recurrence relations'' and its place in teaching students of Informatics is discussed in this paper. We represent many arguments about the importance, the necessity and the benefit of studying this subject by Informatics students.
Valentin P. BAKOEV
doaj +1 more source
Dissimilarity Vectors of Trees and Their Tropical Linear Spaces (Extended Abstract) [PDF]
We study the combinatorics of weighted trees from the point of view of tropical algebraic geometry and tropical linear spaces. The set of dissimilarity vectors of weighted trees is contained in the tropical Grassmannian, so we describe here the tropical ...
Benjamin Iriarte Giraldo
doaj +1 more source
Characterizing Pyramidal Hadamard Designs With the Largest Number of Fixed Points
ABSTRACT A symmetric ( v , k , λ )‐design is said to be f‐pyramidal, with f < v − 1, under the action of a group G if G acts as an automorphism group fixing f points and acting sharply transitively on the remaining ones. We show that, necessarily, f ≤ v − 2 ( k − λ ). In particular, for a Hadamard design with parameters ( v , k , λ ) = ( 4 m − 1 , 2 m −
Tommaso Traetta
wiley +1 more source
ABSTRACT In an effort to understand the complexity of the maximum independent set problem, Chvátal introduced t‐perfect graphs. While a full characterization of this class remains open, important progress has been made for claw‐free graphs [Bruhn and Stein, Math. Program. 2012] and P 5‐free graphs [Bruhn and Fuchs, SIAM J. Discrete Math. 2017]. We take
Yixin Cao, Shenghua Wang
wiley +1 more source
Tree Independence Number III. Thetas, Prisms and Stars
ABSTRACT We prove that for every t ∈ N there exists τ = τ ( t ) ∈ N such that every (theta, prism, K 1 , t)‐free graph has tree independence number at most τ (where we allow “prisms” to have one path of length zero).
Maria Chudnovsky +2 more
wiley +1 more source

