Results 81 to 90 of about 69,062 (214)

Enumeration and Random Generation of Concurrent Computations [PDF]

Discrete Mathematics & Theoretical Computer Science, 2012
In this paper, we study the shuffle operator on concurrent processes (represented as trees) using analytic combinatorics tools. As a first result, we show that the mean width of shuffle trees is exponentially smaller than the worst case upper-bound.
Olivier Bodini, Antoine Genitrini, Frédéric Peschanski   +2 more
doaj   +1 more source

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

, 2016
Questions in computational molecular biology generate various discrete optimization problems, such as DNA sequence alignment and RNA secondary structure prediction.
Drellich, Elizabeth, Gainer-Dewar, Andrew, Harrington, Heather A., He, Qijun, Heitsch, Christine, Poznanović, Svetlana   +5 more
core   +1 more source

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

Experimental 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

Polyominoes determined by permutations [PDF]

Discrete Mathematics & Theoretical Computer Science, 2006
In this paper we consider the class of $\textit{permutominoes}$, i.e. a special class of polyominoes which are determined by a pair of permutations having the same size. We give a characterization of the permutations associated with convex permutominoes,
I. Fanti, A. Frosini, E. Grazzini, R. Pinzani, S. Rinaldi   +4 more
doaj   +1 more source

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

Journal 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

Label-based parameters in increasing trees [PDF]

Discrete Mathematics & Theoretical Computer Science, 2006
Grown simple families of increasing trees are a subclass of increasing trees, which can be constructed by an insertion process. Three such tree families contained in the grown simple families of increasing trees are of particular interest: $\textit ...
Markus Kuba, Alois Panholzer
doaj   +1 more source

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

Journal 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

Conditioned Galton-Watson trees do not grow [PDF]

Discrete Mathematics & Theoretical Computer Science, 2006
An example is given which shows that, in general, conditioned Galton-Watson trees cannot be obtained by adding vertices one by one, while this can be done in some important but special cases, as shown by Luczak and Winkler.
Svante Janson
doaj   +1 more source

Unimodality Problems in Ehrhart Theory

, 2017
Ehrhart theory is the study of sequences recording the number of integer points in non-negative integral dilates of rational polytopes. For a given lattice polytope, this sequence is encoded in a finite vector called the Ehrhart $h^*$-vector. Ehrhart $h^*
A. Stapledon, Adam McCabe, Akihiro Higashitani, Alexander Postnikov, C. Bey, C. Haase, Carla D. Savage, Carla D. Savage, Christos A. Athanasiadis, E. Ehrhart, E. Katz, Federico Ardila, Francesco Brenti, H. Ohsugi, Hidefumi Ohsugi, I.M. Gelfand, Jan Schepers, Jeffrey C. Lagarias, Jesús A. De Loera, Jesús A. De Loera, Joseph Gubeladze, M. Beck, M. Hochster, M. Kreuzer, M. Mustaţǎ, Maria Chudnovsky, Matthias Beck, Matthias Beck, Matthias Beck, Matthias Beck, Mireille Bousquet-Mélou, Mordechai Katzman, Neil L. White, P. McMullen, R.P. Stanley, RICHARD P. STANLEY, Richard P. Stanley, S. Payne, T. Hibi, T. Hibi, Tadahito Harima, Takayuki Hibi, Takayuki Hibi, Thomas Lam, V.V. Batyrev, Winfried Bruns   +45 more
core   +1 more source

On extremal problems associated with random chords on a circle

Mathematika, Volume 71, Issue 4, October 2025.
Abstract Inspired by the work of Karamata, we consider an extremization problem associated with the probability of intersecting two random chords inside a circle of radius r,r∈(0,1]$r, \, r \in (0,1]$, where the endpoints of the chords are drawn according to a given probability distribution on S1$\mathbb {S}^1$.
Cynthia Bortolotto, João P. G. Ramos
wiley   +1 more source