Results 61 to 70 of about 98,708 (229)

Markov's conjecture on integral necklaces

open access: yesBulletin of the London Mathematical Society, EarlyView.
Abstract We use the geometric reformulation of Markov's uniqueness conjecture in terms of the simple length spectrum of the modular torus to rewrite the conjecture in combinatorial terms by explicitly describing this set of lengths.
David Fisac
wiley   +1 more source

Geometric combinatorics and computational molecular biology: branching polytopes for RNA sequences

open access: yes, 2016
Questions in computational molecular biology generate various discrete optimization problems, such as DNA sequence alignment and RNA secondary structure prediction.
Drellich, Elizabeth   +5 more
core   +1 more source

The Combinatorics of Tastes and Humours in Classical Indian Medicine and Mathematics

open access: yesJournal of Indian Philosophy, 2000
This paper explores some combinatoric problems which are treated in the Sanskrit literature of both ayurveda (medicine) and of jyothsastra (mathematics).
openaire   +3 more sources

Spaceborne and spaceborn: Physiological aspects of pregnancy and birth during interplanetary flight

open access: yesExperimental Physiology, EarlyView.
Abstract Crewed interplanetary return missions that are on the planning horizon will take years, more than enough time for initiation and completion of a pregnancy. Pregnancy is viewed as a sequence of processes – fertilization, blastocyst formation, implantation, gastrulation, placentation, organogenesis, gross morphogenesis, birth and neonatal ...
Arun V. Holden
wiley   +1 more source

Combinatorics and Geometry of Transportation Polytopes: An Update [PDF]

open access: yes, 2013
A transportation polytope consists of all multidimensional arrays or tables of non-negative real numbers that satisfy certain sum conditions on subsets of the entries.
De Loera, Jesús A., Kim, Edward D.
core  

International Journal Of Mathematical Combinatorics

open access: yes, 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

Enumeration of E ( s 2 )‐Optimal and Minimax‐Optimal Supersaturated Designs With 12 Rows, 11 q Columns and s max = 4

open access: yesJournal of Combinatorial Designs, Volume 33, Issue 10, Page 379-387, October 2025.
ABSTRACT The E ( s 2 )‐optimal and minimax‐optimal supersaturated designs (SSDs) with 12 rows, 11 q columns, and s max = 4 are enumerated in a computer search: there are, respectively, 34, 146, 0, 3, and 1 such designs for q = 2 , 3 , 4 , 5, and 6. Cheng and Tang proved that for q > 6, there are no such SSDs.
Luis B. Morales
wiley   +1 more source

Mathematics For Everything With Combinatorics On Nature – A Report On The Promoter Dr.Linfan Mao Of Mathematical Combinatorics

open access: yes, 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

Symmetric 2‐ ( 35 , 17 , 8 ) Designs With an Automorphism of Order 2

open access: yesJournal of Combinatorial Designs, Volume 33, Issue 10, Page 399-403, October 2025.
ABSTRACT The largest prime p that can be the order of an automorphism of a 2‐ ( 35 , 17 , 8 ) design is p = 17, and all 2‐ ( 35 , 17 , 8 ) designs with an automorphism of order 17 were classified by Tonchev. The symmetric 2‐ ( 35 , 17 , 8 ) designs with automorphisms of an odd prime order p < 17 were classified in Bouyukliev, Fack and Winne and ...
Sanja Rukavina, Vladimir D. Tonchev
wiley   +1 more source

Home - About - Disclaimer - Privacy