Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Partitions of sets"'
Publikováno v:
International Journal of Metrology and Quality Engineering, Vol 15, p 4 (2024)
Policy decisions are often motivated by results attained by a cohort of responders to a survey or a test. However, erroneous identification of the reliability or the complimentary uncertainty of the test/survey instrument, will distort the data that
Externí odkaz:
https://doaj.org/article/c3172b93e1a849c59efd3bc64fa550b4
Publikováno v:
The Annals of Probability, 1997 Jul 01. 25(3), 1257-1283.
Externí odkaz:
https://www.jstor.org/stable/2959560
Publikováno v:
Quaestiones Mathematicae; Vol 39, No 7 (2016); 863-873
A total dominating set in a graph G is a set S of vertices of G such that every vertex in G is adjacent to a vertex of S. We study graphs whose vertex set can be partitioned into two total dominating sets. In particular, we develop several sufficient
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b7751e4978516dbc5ec0883cee0e8383
https://www.ajol.info/index.php/qm/article/view/148709
https://www.ajol.info/index.php/qm/article/view/148709
Autor:
Víctor Blanco, José Carlos Rosales
Publikováno v:
Computers & Mathematics with Applications. 63:1204-1211
In this paper, we present an efficient algorithm to compute the whole set of numerical semigroups with a given Frobenius number F. The methodology is based on the construction of a partition of that set by a congruence relation. It is proven that eac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9cdae2ccbb306e89e912060904ac8538
https://doi.org/10.1016/j.camwa.2011.12.034
https://doi.org/10.1016/j.camwa.2011.12.034
Autor:
Bodo Lass
Publikováno v:
Journal of Combinatorial Theory, Series B. 102(2):411-423
The independence polynomial of a graph G is the polynomial I∑x|I|∑Ix|I|, summed over all independent subsets I⊆V(G)I⊆V(G). We show that if G is clawfree, then there exists a Mehler formula for its independence polynomial. This was proved for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::017ef84cf9539b8f31402d989394fb6e
Autor:
Gabriel, Franck
In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an integer pa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3ec103da887cca9ed7368b3b3c3af547
http://arxiv.org/abs/1503.02792
http://arxiv.org/abs/1503.02792
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Bulletin of Mathematical Biology
The establishment of associations between bivalents from Mus domesticus\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pmid________::6f2a1180f88945490c4e8803001e7845
https://pubmed.ncbi.nlm.nih.gov/25033783
https://pubmed.ncbi.nlm.nih.gov/25033783
Autor:
Timothy C. Wallstrom, Gian-Carlo Rota
Publikováno v:
Gian-Carlo Rota on Analysis and Probability ISBN: 9781461274025
Ann. Probab. 25, no. 3 (1997), 1257-1283
Ann. Probab. 25, no. 3 (1997), 1257-1283
A combinatorial definition of multiple stochastic integrals is given in the setting of random measures. It is shown that some properties of such stochastic integrals, formerly known to hold in special cases, are instances of combinatorial identities
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::faa15a529a9e09570c9f67f6b4aa2c2c
https://doi.org/10.1007/978-1-4612-2070-1_45
https://doi.org/10.1007/978-1-4612-2070-1_45
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.