Results 61 to 70 of about 69,347 (192)

Plank theorems and their applications: A survey

open access: yesBulletin of the London Mathematical Society, EarlyView.
Abstract Plank problems concern the covering of convex bodies by planks in Euclidean space and are related to famous open problems in convex geometry. In this survey, we introduce plank problems and present surprising applications of plank theorems in various areas of mathematics.
William Verreault
wiley   +1 more source

Around the root of random multidimensional quadtrees [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2006
We analyse the distribution of the root pattern of randomly grown multidimensional point quadtrees. In particular, exact, recursive and asymptotic formulas are given for the expected arity of the root.
Gilbert Labelle   +2 more
doaj   +1 more source

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

Efficient estimation of the cardinality of large data sets [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2006
Giroire has recently proposed an algorithm which returns the $\textit{approximate}$ number of distinct elements in a large sequence of words, under strong constraints coming from the analysis of large data bases.
Philippe Chassaing, Lucas Gerin
doaj   +1 more source

Dimer models and conformal structures

open access: yesCommunications on Pure and Applied Mathematics, Volume 79, Issue 2, Page 340-446, February 2026.
Abstract Dimer models have been the focus of intense research efforts over the last years. Our paper grew out of an effort to develop new methods to study minimizers or the asymptotic height functions of general dimer models and the geometry of their frozen boundaries.
Kari Astala   +3 more
wiley   +1 more source

Predecessor and Permutation Existence Problems for Sequential Dynamical Systems. [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2003
A class of finite discrete dynamical systems, called Sequential Dynamical Systems (SDSs), was introduced in [BR99] as a formal model for analyzing simulation systems.
Christopher L. Barrett   +5 more
doaj   +1 more source

Antichain cutsets of strongly connected posets

open access: yes, 2012
Rival and Zaguia showed that the antichain cutsets of a finite Boolean lattice are exactly the level sets. We show that a similar characterization of antichain cutsets holds for any strongly connected poset of locally finite height.
A Aramova   +20 more
core   +1 more source

Steiner Triple Systems With High Discrepancy

open access: yesJournal of Combinatorial Designs, Volume 34, Issue 1, Page 5-14, January 2026.
ABSTRACT In this paper, we initiate the study of discrepancy questions for combinatorial designs. Specifically, we show that, for every fixed r ≥ 3 and n ≡ 1 , 3 ( mod 6 ), any r‐colouring of the triples on [ n ] admits a Steiner triple system of order n with discrepancy Ω ( n 2 ).
Lior Gishboliner   +2 more
wiley   +1 more source

Formalizing the transformations of a cognitive universe [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2003
In an effort to continue the pioneering work of Harary in USA and Flament in France, we have undertaken to develop, on an experimental basis, a formalized theory of systems of beliefs and their modifications.
N. Lafaye de Micheaux   +3 more
doaj   +1 more source

Completing Multi‐Latin Rectangles via Factors With Prescribed Degrees in Bipartite Graphs

open access: yesJournal of Combinatorial Designs, Volume 34, Issue 1, Page 31-36, January 2026.
ABSTRACT Let Q be an n × n array whose top left r × s sub‐array L is filled with a set of k different symbols such that each cell of L contains λ symbols. In this note, we find conditions under which each empty cell of Q can be filled with λ symbols in such a way that the total number of occurrences of each symbol is prescribed and that each symbol ...
Amin Bahmanian
wiley   +1 more source

Home - About - Disclaimer - Privacy