Results 81 to 90 of about 217,204 (287)
A course on Combinatorial Algorithms [PDF]
The paper presents a course on Combinatorial Algorithms that is based on the drafts of the author that he used while teaching the course in the Department of Informatics and Applied Mathematics of Yerevan State University, Armenia from February 2007 to June 2007.
arxiv
Bioinspired Design of Isotropic Lattices with Tunable and Controllable Anisotropy
This study introduces nested isotropic lattices, integrating architectural elements like nesting orders and orientations inspired by bioarchitectures. The design enables tunable anisotropy across nine mono‐nest and twenty multi‐nest lattices with 252 parametric variations, demonstrating transitions from shear‐ to tensile‐compression‐dominant behaviors ...
Ramalingaiah Boda+2 more
wiley +1 more source
All graphs of order n ≥ 11 and diameter 2 with partition dimension n − 3
All graphs of order n with partition dimension 2, n−2, n−1, or n have been characterized. However, finding all graphs on n vertices with partition dimension other than these above numbers is still open.
Edy Tri Baskoro, Debi Oktia Haryeni
doaj
Using novel probe‐based metrics, this study evaluates lattice structures on criteria critical to cellular solid optimization. Triply‐periodic minimal surface (TPMS) lattices outperform other lattices, offering more predictable mechanical behavior in complex design spaces and, as a result, higher performance in optimized models.
Firas Breish+2 more
wiley +1 more source
The MaterialDigital initiative drives the digital transformation of material science by promoting findable, accessible, interoperable, and reusable principles and enhancing data interoperability. This article explores the role of scientific workflows, highlights challenges in their adoption, and introduces the Workflow Store as a key tool for sharing ...
Simon Bekemeier+37 more
wiley +1 more source
Subdivision of graphs in R(mK2,P4)
For any graphs F,G, and H, the notation F→(G,H) means that any red-blue coloring of all edges of F will contain either a red copy of G or a blue copy of H. The set R(G,H) consists of all Ramsey (G,H)-minimal graphs, namely all graphs F satisfying F→(G,H)
Kristiana Wijaya+3 more
doaj
Mathematical aspect of the combinatorial game "Mahjong"
We illustrate how one can use basic combinatorial theory and computer programming technique (Python) to analyze the combinatorial game: Mahjong. The results confirm some folklore concerning the game, and expose some unexpected results. Related results and possible future research in connection to artificial intelligence are mentioned.
Cheng, Yuan+2 more
openaire +2 more sources
A Local Characterization of Combinatorial Multihedrality in Tilings [PDF]
A locally finite face-to-face tiling of euclidean d-space by convex polytopes is called combinatorially multihedral if its combinatorial automorphism group has only finitely many orbits on the tiles. The paper describes a local characterization of combinatorially multihedral tilings in terms of centered coronas.
arxiv
Elastic‐Wave Propagation in Chiral Metamaterials: A Couple‐Stress Theory Perspective
The intrinsic chirality of chiral metamaterials renders an effective medium based on the classical continuum theory ineffective for predicting their acoustic activity. This limitation is addressed in the present study by employing augmented asymptotic homogenization to derive a couple‐stress‐based effective medium, enabling accurate predictions in the ...
Shahin Eskandari+5 more
wiley +1 more source
This study examines the mechanical properties of triply periodic minimal surfaces (TPMS)‐based lattices, analyzing 36 architectures in elastic and plastic regimes. It evaluates the applicability of beam‐based scaling laws to TPMS lattices. Rigidity arises from the alignment of members with the load direction and solid regions preventing rotation.
Lucía Doyle+2 more
wiley +1 more source