Results 61 to 70 of about 352 (164)

Random structures for partially ordered sets

, 2006
This thesis is presented in two parts. In the first part, we study a family of models of random partial orders, called classical sequential growth models, introduced by Rideout and Sorkin as possible models of discrete space-time.
Georgiou, Nicholas
core  

Formalization of some central theorems in combinatorics of finite sets

We present fully formalized proofs of some central theorems from combinatorics. These are Dilworth's decomposition theorem, Mirsky's theorem, Hall's marriage theorem and the Erdős-Szekeres theorem. Dilworth's decomposition theorem is the key result among
Abhishek Kr Singh
core   +1 more source

Response to a report published by the Office for Risk Assessment & Research of the Netherlands Food and Product Safety Authority on three EFSA quantitative pest risk assessments

EFSA Journal, Volume 24, Issue 6, June 2026.
Abstract A report commenting on three quantitative pest risk assessments (qPRA) of the EFSA PLH Panel (Panel) was published in November 2025 by the Office for Risk Assessment & Research (BuRO) of the Netherlands Food and Product Safety Authority. In that report, the approaches applied by the Panel in three qPRA were narratively scrutinised against an ...
EFSA Panel on Plant Health (PLH), Paula Baptista, Anna Berlin, Elisavet Chatzivassiliou, Jaime Cubero, Nik Cunniffe, Eduardo de la Peña, Nicolas Desneux, Francesco Di Serio, Anna Filipiak, Paolo Gonthier, Beata Hasiów‐Jaroszewska, Hervé Jactel, Blanca B. Landa, Lara Maistrello, David Makowski, Panagiotis Milonas, Nikos T. Papadopoulos, Roel Potting, Hanna Susi, Hans‐Hermann Thulke, Matteo Crotta, Ewelina Czwienczek, Olaf Mosbach‐Schulz, Marco Pautasso, Giuseppe Stancanelli, Antonio Vicent Civera   +26 more
wiley   +1 more source

Problems in graph theory and partially ordered sets

, 2019
This dissertation answers problems in three areas of combinatorics - processes on graphs, graph coloring, and antichains in a partially ordered set.First we consider Zero Forcing on graphs, an iterative infection process introduced by AIM Minimum Rank ...
Smith, Stephen Gene Zane
core  

Dagstuhl Reports : Volume 1, Issue 2, February 2011

, 2011
Online Privacy: Towards Informational Self-Determination on the Internet (Dagstuhl Perspectives Workshop 11061) : Simone Fischer-Hübner, Chris Hoofnagle, Kai Rannenberg, Michael Waidner, Ioannis Krontiris and Michael Marhöfer Self-Repairing Programs ...
Schloss Dagstuhl, Leibniz-Zentrum für Informatik
core  

Interactive animation of ordered set algorithms using three-dimensional graphics.

, 1997
After reading the book Combinatorics and Partially Ordered Sets written by W. T. Trotter, we wondered how much more effective an interactive version of this book would be. Using hypertext linking techniques a reader would get immediate access not only to
Ben Saidane, Nabil.
core   +1 more source

The geometry of independence tree models with hidden variables [PDF]

, 2010
In this paper we investigate the geometry of undirected discrete graphical models of trees when all the variables in the system are binary, where leaves represent the observable variables and where the inner nodes are unobserved.
Zwiernik, Piotr, Smith, J. Q.
core  

Information Inequalities via Submodularity and a Problem in Extremal Graph Theory. [PDF]

Entropy (Basel), 2022
Sason I.
europepmc   +1 more source

Monge extensions of cooperation and communication structures [PDF]

Cooperation structures without any {\it a priori} assumptions on the combinatorial structure of feasible coalitions are studied and a general theory for mar\-ginal values, cores and convexity is established.
Ulrich Faigle, Michel Grabisch, Maximilian Heyne   +2 more
core  

Sperner theorems for unrelated copies of some partially ordered sets in a powerset lattice and minimum generating sets of powers of distributive lattices

, 2023
For a finite poset (partially ordered set) $U$ and a natural number $n$, let Sp$(U,n)$ denote the largest number of pairwise unrelated copies of $U$ in the powerset lattice (AKA subset lattice) of an $n$-element set.
Czédli, Gábor
core