Results 71 to 80 of about 69,062 (214)
Abundant Neighborhoods, Two‐Sided Markets, and Maximal Matchings
Naval Research Logistics (NRL), EarlyView.ABSTRACT I introduce a new graph‐theoretic property called abundant neighborhoods. This property is motivated by studying the thickness of economic markets. A vertex is, roughly, guaranteed to match if and only if it has an abundant neighborhood.
Muhammad Maaz
wiley +1 more source
Predecessor and Permutation Existence Problems for Sequential Dynamical Systems. [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 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
Further applications of the Container Method
, 2016 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
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
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 +3 more
doaj +1 more source
Normal covering numbers for Sn$S_n$ and An$A_n$ and additive combinatorics
Bulletin of the London Mathematical Society, EarlyView.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
On the spectral dimension of random trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 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
Combinatorics in the Art of the Twentieth Century [PDF]
, 2017 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
Antichain cutsets of strongly connected posets
, 2012 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
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 +4 more
wiley +1 more source