Results 61 to 70 of about 1,223,570 (139)
Machine Learning for Synthetic Organic Chemistry: Methods, Applications, and Best Practices
Angewandte Chemie Novit, Volume 2, Issue 3, September 2026.Artificial intelligence (AI) and machine learning (ML) are increasingly reshaping experimental chemistry. This review maps the challenges of synthetic organic chemistry to modern digital tools that can help address them. While focusing on the practical application of ML tools in real‐world laboratory settings, we outline prerequisites, emerging ...
Niklas Hölter +3 more
wiley +1 more source
Making mathematics meaningful: Using student-initiated problems to situate mathematics [PDF]
, 2014 Mathematics is everywhere-from the minute we open our eyes to check the alarm clock and calculate how many minutes extra we can afford to lie in bed, to measuring out our cereal for breakfast and estimating if we have enough petrol to make the 18 ...
Brough, Chris Jane, Calder, Nigel Stuart
core
Generating transformation semigroups using endomorphisms of preorders, graphs, and tolerances [PDF]
, 2010 Let ΩΩ be the semigroup of all mappings of a countably infinite set Ω. If U and V are subsemigroups of ΩΩ, then we write U≈V if there exists a finite subset F of ΩΩ such that the subsemigroup generated by U and F equals that generated by V and F.
Morayne, Michal +11 more
core +1 more source
Colourings of Uniform Group Divisible Designs and Maximum Packings
Journal of Combinatorial Designs, Volume 34, Issue 9, Page 437-456, September 2026.ABSTRACT A weak c‐colouring of a design is an assignment of colours to its points from a set of 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
AUTOMORPHISM GROUPS OF MAPS, SURFACES AND SMARANDACHE GEOMETRIES [PDF]
, 2011 Automorphism groups survey similarities on mathematical systems, which appear nearly in all mathematical branches, such as those of algebra, combinatorics, geometry, · · · and theoretical physics, theoretical chemistry, etc..
MAO, LINFAN
core +1 more source
, 2016 The science’s function is realizing the natural world, developing our society in coordination with natural laws and the mathematics provides the quantitative tool and method for solving problems helping with that understanding. Generally, understanding a natural thing by mathematical ways or means to other sciences are respectively establishing ...
openaire +2 more sources
Combinatorics: The Mathematics of Fair Thieves and Sophisticated Forgetters
Frontiers for Young Minds, 2023 Mathematics is the most logical and unbiased scientific field there is. What is true in mathematics today will forever stay true, and mathematical arguments will always clearly indicate which side “wins”. These are some of the characteristics of mathematics that I have liked very much since I was young.
openaire +1 more source
On Tight Tree‐Complete Hypergraph Ramsey Numbers
Journal of Graph Theory, Volume 113, Issue 1, Page 88-96, September 2026.ABSTRACT Chvátal showed that for any tree T with k edges, the Ramsey number R ( T , n ) = k ( n − 1 ) + 1. For r = 3 or 4, we show that, if T is an r‐uniform nontrivial tight tree, then the hypergraph Ramsey number R ( T , n ) = Θ ( n r − 1 ). The 3‐uniform result comes from observing a construction of Cooper and Mubayi.
Jiaxi Nie
wiley +1 more source
International Journal Of Mathematical Combinatorics
, 2015 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 100-150 pages approx. per volume, which publishes original research papers and survey articles in all aspects of Smarandachemulti-spaces, Smarandache ...
openaire +2 more sources
Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices
Journal of Graph Theory, Volume 113, Issue 1, Page 143-164, September 2026.ABSTRACT Given a graph G, we say that an orientation D of G is a KT orientation if, for all u , v ∈ V ( D ), there is at most one directed path (in any direction) between u and v. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as counterexamples to various ...
Barbora Dohnalová +3 more
wiley +1 more source