Results 31 to 40 of about 143,013 (228)
Completing Multi‐Latin Rectangles via Factors With Prescribed Degrees in Bipartite Graphs
Journal of Combinatorial Designs, EarlyView.ABSTRACT Let Q $Q$ be an n×n $n\times n$ array whose top left r×s $r\times s$ sub‐array L $L$ is filled with a set of k $k$ different symbols such that each cell of L $L$ contains λ $\lambda $ symbols. In this note, we find conditions under which each empty cell of Q $Q$ can be filled with λ $\lambda $ symbols in such a way that the total number of ...
Amin Bahmanian
wiley +1 more source
New Difference Triangle Sets by a Field‐Programmable Gate Array‐Based Search Technique
Journal of Combinatorial Designs, EarlyView.ABSTRACT We provide some difference triangle sets with scopes that improve upon the best known values. These are found with purpose‐built digital circuits realized with field‐programmable gate arrays (FPGAs) rather than software algorithms running on general‐purpose processors.
Mohannad Shehadeh +2 more
wiley +1 more source
Decomposition spaces in combinatorics [PDF]
, 2016 A decomposition space (also called unital 2-Segal space) is a simplicial object satisfying an exactness condition weaker than the Segal condition: just as the Segal condition expresses (up to homotopy) composition, the new condition expresses ...
Gálvez Carrillo, Maria Immaculada +2 more
core +1 more source
Discrete Mathematics, 2002 This nice survey paper gives a short introduction into Daniel Kleitman's seminal contributions to combinatorics, with special emphasis on extremal hypergraph theory, asymptotic enumerations, and discrete geometry.
openaire +3 more sources
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
Enumeration of three term arithmetic progressions in fixed density sets [PDF]
, 2014 Additive combinatorics is built around the famous theorem by Szemer\'edi which asserts existence of arithmetic progressions of any length among the integers. There exist several different proofs of the theorem based on very different techniques.
Sjöland, Erik
core
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 +45 more
core +1 more source
CPT: Pharmacometrics &Systems Pharmacology, EarlyView.ABSTRACT Binding in cis‐configuration to the PD‐1 receptor (PD‐1) and IL‐2βγ$$ \beta \gamma $$ receptor (IL‐2Rβγ$$ \beta \gamma $$) has been shown to lead to differentiation of CD8 T cells to better effectors, which is anticipated to drive efficacy of the immune‐targeted cytokine eciskafusp alfa, or PD1‐IL2v.
Lucy G. Hutchinson +6 more
wiley +1 more source
Combinatorial optimization approach for the efficient reuse of RC components
Structural Concrete, EarlyView.Abstract The reuse of reinforced concrete (RC) components from deconstructed buildings offers a promising approach to reduce the environmental impact of new constructions. However, it represents a complex combinatorial optimization problem to efficiently place the available modules, which vary in geometry and load‐bearing capacity, into new structures ...
Jannis Rose +4 more
wiley +1 more source
The Role of Dice in the Emergence of the Probability Calculus
International Statistical Review, EarlyView.Summary The early development of the probability calculus was clearly influenced by the roll of dice. However, while dice have been cast since time immemorial, documented calculations on the frequency of various dice throws date back only to the mid‐13th century.
David R. Bellhouse, Christian Genest
wiley +1 more source