Results 41 to 50 of about 37,501 (244)

International Journal of Mathematical Combinatorics, Vol.4A [PDF]

open access: yes, 2010
The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core   +1 more source

Combinatorics [PDF]

open access: yes, 2006
This is the report on the Oberwolfach workshop on Combinatorics, held 1–7 January 2006. Combinatorics is a branch of mathematics studying families of mainly, but not exclusively, finite or countable structures – discrete objects.
Hans Jürgen Prömel, László Lovász
core   +3 more sources

Mixed Steiner Triple Systems With Shortest Length

open access: yesJournal of Combinatorial Designs, EarlyView.
ABSTRACT A mixed Steiner triple system is a 3‐GDD which is viewed as a code with minimum Hamming distance 3. These codes are the minimum weight codewords of a 1‐perfect code over a mixed alphabet, when the related codes exist, and provide the connection between 3‐GDDs and coding theory.
Tuvi Etzion
wiley   +1 more source

Kaleidoscopic Edge-Coloring of Complete Graphs and r-Regular Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2019
For an r-regular graph G, we define an edge-coloring c with colors from {1, 2, . . . , k}, in such a way that any vertex of G is incident with at least one edge of each color. The multiset-color cm(v) of a vertex v is defined as the ordered tuple (a1, a2,
Li Xueliang, Zhu Xiaoyu
doaj   +1 more source

Distribution of the Number of Encryptions in Revocation Schemes for Stateless Receivers [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2008
We study the number of encryptions necessary to revoke a set of users in the complete subtree scheme (CST) and the subset-difference scheme (SD). These are well-known tree based broadcast encryption schemes.
Christopher Eagle   +4 more
doaj   +1 more source

Characterizing Pyramidal Hadamard Designs With the Largest Number of Fixed Points

open access: yesJournal of Combinatorial Designs, EarlyView.
ABSTRACT A symmetric (v,k,λ) $(v,k,\lambda )$‐design is said to be f $f$‐pyramidal, with f
Tommaso Traetta
wiley   +1 more source

Constructing elliptic curve isogenies in quantum subexponential time

open access: yesJournal of Mathematical Cryptology, 2014
Given two ordinary elliptic curves over a finite field having the same cardinality and endomorphism ring, it is known that the curves admit a nonzero isogeny between them, but finding such an isogeny is believed to be computationally difficult.
Childs Andrew   +2 more
doaj   +1 more source

List circular backbone colouring [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2014
A natural generalization of graph colouring involves taking colours from a metric space and insisting that the endpoints of an edge receive colours separated by a minimum distance dictated by properties of the edge.
Frederic Havet, Andrew D. King
doaj   +1 more source

Teaching Combinatorial Principles Using Relations through the Placemat Method

open access: yesMathematics, 2021
The presented paper is devoted to an innovative way of teaching mathematics, specifically the subject combinatorics in high schools. This is because combinatorics is closely connected with the beginnings of informatics and several other scientific ...
Viliam Ďuriš   +3 more
doaj   +1 more source

On the combinatorics of plethysm

open access: yesJournal of Combinatorial Theory, Series A, 1987
The preceding review of A. Kerber comprises both articles, the one reviewed there and the present one, in a joint review. The reader is therefore kindly requested to read the preceding review.
Oscar, A., Nava, Z.
openaire   +3 more sources

Home - About - Disclaimer - Privacy