Results 31 to 40 of about 184,660 (274)
, 2006 "[M]athematicians care no more for logic than logicians for mathematics." Augustus de Morgan, 1868. Proofs are traditionally syntactic, inductively generated objects.
Hughes, Dominic
core +4 more sources
On the existence of block-transitive combinatorial designs [PDF]
, 2010 Block-transitive Steiner $t$-designs form a central part of the study of highly symmetric combinatorial configurations at the interface of several disciplines, including group theory, geometry, combinatorics, coding and information theory, and ...
Huber, Michael
core +4 more sources
On the enumeration of uniquely reducible double designs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A double $2$-$(v,k,2 \lambda)$ design is a design which is reducible into two $2$-$(v,k,\lambda)$ designs. It is called uniquely reducible if it has, up to equivalence, only one reduction.
Veerle Fack +2 more
doaj +1 more source
Subdivision of graphs in R(mK2,P4)
Heliyon, 2020 For any graphs F,G, and H, the notation F→(G,H) means that any red-blue coloring of all edges of F will contain either a red copy of G or a blue copy of H. The set R(G,H) consists of all Ramsey (G,H)-minimal graphs, namely all graphs F satisfying F→(G,H)
Kristiana Wijaya +3 more
doaj +1 more source
A Local Characterization of Combinatorial Multihedrality in Tilings
, 2008 A locally finite face-to-face tiling of euclidean d-space by convex polytopes is called combinatorially multihedral if its combinatorial automorphism group has only finitely many orbits on the tiles.
Dolbilin, Nikolai, Schulte, Egon
core +1 more source
The locating-chromatic number for Halin graphs
Communications in Combinatorics and Optimization, 2017 Let $G$ be a connected graph. Let $f$ be a proper $k$-coloring of $G$ and $\Pi=\{R_1,R_2,\ldots, R_k\}$ be an ordered partition of $V(G)$ into color classes. For any vertex $v$ of $G,$ define the {\em color code} $c_\Pi(v)$ of $v$ with respect to $\
I.A. Purwasih +4 more
doaj +1 more source
Restricted Stirling permutations
, 2016 In this paper, we study the generating functions for the number of pattern restricted Stirling permutations with a given number of plateaus, descents and ascents.
Callan, David +2 more
core +1 more source
Machine learning‐based scheduling: a bibliometric perspective
IET Collaborative Intelligent Manufacturing, 2021 In recent years, the rapid development of artificial intelligence and data science has given rise to the study of data driven algorithms in highly volatile systems. The scheduling of complex shop floor resources falls into such a category, which is often
Shiyun Li +6 more
doaj +1 more source
LDAcoop: Integrating non‐linear population dynamics into the analysis of clonogenic growth in vitro
Molecular Oncology, EarlyView.Limiting dilution assays (LDAs) quantify clonogenic growth by seeding serial dilutions of cells and scoring wells for colony formation. The fraction of negative wells is plotted against cells seeded and analyzed using the non‐linear modeling of LDAcoop.
Nikko Brix +13 more
wiley +1 more source
Word-representability of triangulations of rectangular polyomino with a single domino tile [PDF]
, 2015 A recent elegant result of Akrobotu et al. states that a triangulation of any convex polyomino is word-representable if and only if it is 3-colorable. In this paper, we generalize a particular case of this result by showing that the result of Akrobotu et
Glen, Marc, Kitaev, Sergey
core +1 more source