Related papers: Access Structures Determined by Uniform Polymatroi…
Efficient deterministic algorithms to construct representations of lattice path matroids over finite fields are presented. They are built on known constructions of hierarchical secret sharing schemes, a recent characterization of…
We introduce a procedure that solves the decision problem whether a given matroid M is a gammoid. The procedure consists of three pieces: First, we introduce a notion of a valid matroid tableau which captures the current state of knowledge…
Secret sharing allows distributing a secret among several parties such that only authorized subsets, specified by an access structure, can reconstruct the secret. Sehrawat and Desmedt (COCOON 2020) introduced hidden access structures, that…
Motivated by many practical applications, in this paper we study {\em budget feasible mechanisms} where the goal is to procure independent sets from matroids. More specifically, we are given a matroid $\mathcal{M}=(E,\mathcal{I})$ where…
A multiparty session formalises a set of concurrent communicating participants. We propose a type system for multiparty sessions where some communications between participants can be ignored. This allows us to type some sessions with global…
We consider three matroids defined by Kalai in 1985: the symmetric completion matroid $\mathcal{S}_d$ on the edge set of a looped complete graph; the hyperconnectivity matroid $\mathcal{H}_d$ on the edge set of a complete graph; and the…
We introduce the concept of multilevel fair allocation of resources with tree-structured hierarchical relations among agents. While at each level it is possible to consider the problem locally as an allocation of an agent to its children,…
In this paper we consider monomial localizations of monomial ideals and conjecture that a monomial ideal is polymatroidal if and only if all its monomial localizations have a linear resolution. The conjecture is proved for squarefree…
We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…
Multiparty session types (MPST) are a specification and verification framework for distributed message-passing systems. The communication protocol of the system is specified as a global type, from which a collection of local types (local…
We give graphical characterisation of the access structure to both classical and quantum information encoded onto a multigraph defined for prime dimension $q$, as well as explicit decoding operations for quantum secret sharing based on…
The theory of rough sets is concerned with the lower and upper approximations of objects through a binary relation on a universe. It has been applied to machine learning, knowledge discovery and data mining. The theory of matroids is a…
Hierarchical clustering is a powerful tool for exploratory data analysis, organizing data into a tree of clusterings from which a partition can be chosen. This paper generalizes these ideas by proving that, for any reasonable hierarchy, one…
We consider networks of infinite-dimensional port-Hamiltonian systems $\mathfrak{S}_i$ on one-dimensional spatial domains. These subsystems of port-Hamiltonian type are interconnected via boundary control and observation and are allowed to…
As closed-loop materials discovery systems scale to produce millions of candidate compounds, the credibility of the novelty they reward becomes a critical concern. Novelty is commonly assessed against databases of ordered crystal…
We study the probabilistic assignment of items to platforms that satisfies both group and individual fairness constraints. Each item belongs to specific groups and has a preference ordering over platforms. Each platform enforces group…
We generalize the 1/3-2/3 conjecture from partially ordered sets to antimatroids: we conjecture that any antimatroid has a pair of elements x,y such that x has probability between 1/3 and 2/3 of appearing earlier than y in a uniformly…
We define and study a collection of matroid isomorphism games corresponding to various axiomatic characterizations of matroids. These are nonlocal games played between two cooperative players. Each game is played on two matroids, and the…
The problem of covering the ground set of two matroids by a minimum number of common independent sets is notoriously hard even in very restricted settings, i.e.\ when the goal is to decide if two common independent sets suffice or not.…
Multiparty sessions are systems of concurrent processes, which allow several participants to communicate by sending and receiving messages. Their overall behaviour can be described by means of global types. Typable multiparty session enjoy…