Results 71 to 80 of about 68,778 (203)

Formalizing the transformations of a cognitive universe [PDF]

Discrete 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, G. López, P. Vitiello, J. L. Beauvois   +3 more
doaj   +1 more source

Girth in GF(q)$\textsf {GF}(q)$‐representable matroids

Bulletin of the London Mathematical Society, EarlyView.
Abstract We prove a conjecture of Geelen, Gerards, and Whittle that for any finite field GF(q)$\textsf {GF}(q)$ and any integer t$t$, every cosimple GF(q)$\textsf {GF}(q)$‐representable matroid with sufficiently large girth contains either M(Kt)$M(K_t)$ or M(Kt)∗$M(K_t)^*$ as a minor.
James Davies, Meike Hatzel, Kolja Knauer, Rose McCarty, Torsten Ueckerdt   +4 more
wiley   +1 more source

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

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

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

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

Completing Partial k‐Star Designs

Journal of Combinatorial Designs, Volume 33, Issue 12, Page 446-455, December 2025.
ABSTRACT A k‐star is a complete bipartite graph K 1 , k. A partial k‐star design of order n is a pair ( V , A ) where V is a set of n vertices and A is a set of edge‐disjoint k‐stars whose vertex sets are subsets of V. If each edge of the complete graph with vertex set V is in some star in A, then ( V , A ) is a (complete) k‐star design.
Ajani De Vas Gunasekara, Daniel Horsley
wiley   +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

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

Maximum Shattering

Journal of Combinatorial Designs, Volume 33, Issue 12, Page 456-470, December 2025.
ABSTRACT A family ℱ of subsets of [ n ] = { 1 , 2 , … , n } shatters a set A ⊆ [ n ] if for every A ′ ⊆ A, there is an F ∈ ℱ such that F ∩ A = A '. We develop a framework to analyze f ( n , k , d ), the maximum possible number of subsets of [ n ] of size d that can be shattered by a family of size k.
Noga Alon, Varun Sivashankar, Daniel G. Zhu   +2 more
wiley   +1 more source