Results 61 to 70 of about 68,778 (203)
Combinatorial optimization approach for the efficient reuse of RC components
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
Antichain cutsets of strongly connected posets
Rival and Zaguia showed that the antichain cutsets of a finite Boolean lattice are exactly the level sets. We show that a similar characterization of antichain cutsets holds for any strongly connected poset of locally finite height.
A Aramova +20 more
core +1 more source
Efficient estimation of the cardinality of large data sets [PDF]
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
Cluster‐Randomized Trials in Emergency Care Research
ABSTRACT Objective Cluster‐randomized trials (also called group‐randomized trials) are increasingly common in emergency care research. In such trials, groups of participants are allocated to different interventions based on naturally occurring “clusters,” such as clinics, hospitals, or emergency medical services agencies. In this methodological review,
Howard S. Kim +2 more
wiley +1 more source
Further applications of the Container Method
Recently, Balogh--Morris--Samotij and Saxton--Thomason proved that hypergraphs satisfying some natural conditions have only few independent sets. Their main results already have several applications.
Balogh, Jozsef, Wagner, Adam Zsolt
core +1 more source
Predecessor and Permutation Existence Problems for Sequential Dynamical Systems. [PDF]
A class of finite discrete dynamical systems, called Sequential Dynamical Systems (SDSs), was introduced in [BR99] as a formal model for analyzing simulation systems.
Christopher L. Barrett +5 more
doaj +1 more source
A complex network perspective on brain disease
ABSTRACT If brain anatomy and dynamics have a complex network structure as it has become standard to posit, it is reasonable to assume that such a structure should play a key role not only in brain function but also in brain dysfunction. However, exactly how network structure is implicated in brain damage and whether at least some pathologies can be ...
David Papo, Javier M. Buldú
wiley +1 more source
On the spectral dimension of random trees [PDF]
We determine the spectral dimensions of a variety of ensembles of infinite trees. Common to the ensembles considered is that sample trees have a distinguished infinite spine at whose vertices branches can be attached according to some probability ...
Bergfinnur Durhuus +2 more
doaj +1 more source
Normal covering numbers for Sn$S_n$ and An$A_n$ and additive combinatorics
Abstract The normal covering number γ(G)$\gamma (G)$ of a noncyclic group G$G$ is the minimum number of proper subgroups whose conjugates cover the group. We give various estimates for γ(Sn)$\gamma (S_n)$ and γ(An)$\gamma (A_n)$ depending on the arithmetic structure of n$n$. In particular we determine the limsups over γ(Sn)/n$\gamma (S_n) / n$ and γ(An)
Sean Eberhard, Connor Mellon
wiley +1 more source
Combinatorics in the Art of the Twentieth Century [PDF]
This paper is motivated by a question I asked myself: How can combinatorial structures be used in a work of art? Immediately, other questions arose: Whether there are artists that work or think combinatorially?
Barrière Figueroa, Eulalia
core

