Results 61 to 70 of about 69,062 (214)
The first ascent of size $d$ or more in compositions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 A composition of a positive integer $n$ is a finite sequence of positive integers $a_1, a_2, \ldots, a_k$ such that $a_1+a_2+ \cdots +a_k=n$. Let $d$ be a fixed nonnegative integer.
Charlotte Brennan, Arnold Knopfmacher
doaj +1 more source
Agrárpiaci Jelentések Gabona és ipari növények [PDF]
, 2011 Source at https://journalofmathematicsandculture.wordpress.com/2017/12/28/journal-of-mathematics-and-culture-volume-11-number-4/.A group of Sámi middle school mathematics teachers cooperated with researchers over a period of three years in investigating
Børresen, Tove +7 more
core +1 more source
Integrable Combinatorics [PDF]
, 2012 We review various combinatorial problems with underlying classical or quantum integrable structures. (Plenary talk given at the International Congress of Mathematical Physics, Aalborg, Denmark, August 10, 2012.)Comment: 21 pages, 16 figures, proceedings ...
Di Francesco, Philippe
core +1 more source
Journal of Combinatorial Designs, EarlyView.ABSTRACT A family ℱ ${\rm{ {\mathcal F} }}$ of subsets of [ n ] = { 1 , 2 , … , n } $[n]=\{1,2,\ldots ,n\}$ shatters a set A ⊆ [ n ] $A\subseteq [n]$ if for every A ′ ⊆ A ${A}^{^{\prime} }\subseteq A$, there is an F ∈ ℱ $F\in {\rm{ {\mathcal F} }}$ such that F ∩ A = A ' $F\cap A={A}^{\text{'}}$.
Noga Alon +2 more
wiley +1 more source
On the set of Fixed Points of the Parallel Symmetric Sand Pile Model [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Sand Pile Models are discrete dynamical systems emphasizing the phenomenon of $\textit{Self-Organized Criticality}$. From a configuration composed of a finite number of stacked grains, we apply on every possible positions (in parallel) two grain moving ...
Kévin Perrot +2 more
doaj +1 more source
Combinatorics and Geometry of Transportation Polytopes: An Update [PDF]
, 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
Dominating Kt ${K}_{t}$‐Models
Journal of Graph Theory, EarlyView.ABSTRACT A dominating Kt ${K}_{t}$‐model in a graph G $G$ is a sequence (T1,…,Tt) $({T}_{1},\ldots ,{T}_{t})$ of pairwise disjoint non‐empty connected subgraphs of G $G$, such that for 1⩽i
Freddie Illingworth, David R. Wood
wiley +1 more source
Around the root of random multidimensional quadtrees [PDF]
Discrete 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
Chordal Graphs, Even‐Hole‐Free Graphs and Sparse Obstructions to Bounded Treewidth
Journal of Graph Theory, EarlyView.ABSTRACT Even‐hole‐free graphs pose a central challenge in identifying hereditary classes of bounded treewidth. We investigate this matter by presenting and studying the following conjecture: for an integer t≥4 $t\ge 4$ and a graph H $H$, every even‐hole‐free graph of large enough treewidth has an induced subgraph isomorphic to either Kt ${K}_{t}$ or H
Sepehr Hajebi
wiley +1 more source
Efficient estimation of the cardinality of large data sets [PDF]
Discrete 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