Results 21 to 30 of about 324,082 (166)

On the existence of block-transitive combinatorial designs [PDF]

open access: yes, 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

Counting descents, rises, and levels, with prescribed first element, in words [PDF]

open access: yes, 2006
Recently, Kitaev and Remmel [Classifying descents according to parity, Annals of Combinatorics, to appear 2007] refined the well-known permutation statistic ``descent'' by fixing parity of one of the descent's numbers. Results in that paper were extended
Kitaev, Sergey   +2 more
core   +12 more sources

Post-surjectivity and balancedness of cellular automata over groups [PDF]

open access: yes, 2017
We discuss cellular automata over arbitrary finitely generated groups. We call a cellular automaton post-surjective if for any pair of asymptotic configurations, every pre-image of one is asymptotic to a pre-image of the other.
Capobianco, Silvio   +2 more
core   +1 more source

On the residual solvability of generalized free products of solvable groups

open access: yes, 2011
In this paper, we study the residual solvability of the generalized free product of solvable groups.Comment: Discrete Mathematics & Theoretical Computer Science, Vol 13 ...
Kahrobaei, Delaram, Majewicz, Stephen
core   +2 more sources

Encoding Arguments

open access: yes, 2017
Many proofs in discrete mathematics and theoretical computer science are based on the probabilistic method. To prove the existence of a good object, we pick a random object and show that it is bad with low probability.
Morin, Pat   +2 more
core   +1 more source

$2\times 2$ monotone grid classes are finitely based

open access: yes, 2016
In this note, we prove that all $2 \times 2$ monotone grid classes are finitely based, i.e., defined by a finite collection of minimal forbidden permutations.
Albert, Michael, Brignall, Robert
core   +1 more source

Clifford analysis between continuous and discrete [PDF]

open access: yes, 2008
Some decades ago D. Knuth et al. have coined concrete mathematics as the blending of CONtinuous and disCRETE math, taking into account that problems of standard discrete mathematics can often be solved by methods based on continuous mathematics ...
Falcão, M. I., Malonek, H. R.
core   +1 more source

Heredity for generalized power domination

open access: yes, 2016
In this paper, we study the behaviour of the generalized power domination number of a graph by small changes on the graph, namely edge and vertex deletion and edge contraction.
Dorbec, Paul   +2 more
core   +2 more sources

Architectural building safety and health performance model for stratified low-cost housing: education and management tool for building managers [PDF]

open access: yes, 2015
The safety and health performances aspects of a building are the most challenging aspect of facility management. It requires a deep understanding by the building managers on the factors that contribute to health and safety performances.
Akasah, Zainal Abidin   +2 more
core   +1 more source

Организация учебного процесса по дискретной математике и математической логике [PDF]

open access: yes, 2013
In this paper we consider the method of teaching discrete mathematics and mathematical logic for future bachelors of "Mathematics and Computer Science".Рассматривается методика обучения дискретной математике и математической логике будущих бакалавров по ...
Bukusheva, A. V.   +1 more
core  

Home - About - Disclaimer - Privacy