383 research outputs found
Dimension, matroids, and dense pairs of first-order structures
A structure M is pregeometric if the algebraic closure is a pregeometry in
all M' elementarily equivalent to M. We define a generalisation: structures
with an existential matroid. The main examples are superstable groups of U-rank
a power of omega and d-minimal expansion of fields. Ultraproducts of
pregeometric structures expanding a field, while not pregeometric in general,
do have an unique existential matroid.
Generalising previous results by van den Dries, we define dense elementary
pairs of structures expanding a field and with an existential matroid, and we
show that the corresponding theories have natural completions, whose models
also have a unique existential matroid. We extend the above result to dense
tuples of structures.Comment: Version 2.8. 61 page
One-adhesive polymatroids
Adhesive polymatroids were defined by F. Mat\'u\v{s} motivated by entropy
functions. Two polymatroids are adhesive if they can be glued together along
their joint part in a modular way; and are one-adhesive, if one of them has a
single point outside their intersection. It is shown that two polymatroids are
one-adhesive if and only if two closely related polymatroids have any
extension. Using this result, adhesive polymatroid pairs on a five-element set
are characterized
The Maximum Likelihood Threshold of a Graph
The maximum likelihood threshold of a graph is the smallest number of data
points that guarantees that maximum likelihood estimates exist almost surely in
the Gaussian graphical model associated to the graph. We show that this graph
parameter is connected to the theory of combinatorial rigidity. In particular,
if the edge set of a graph is an independent set in the -dimensional
generic rigidity matroid, then the maximum likelihood threshold of is less
than or equal to . This connection allows us to prove many results about the
maximum likelihood threshold.Comment: Added Section 6 and Section
Infinite matroids in graphs
It has recently been shown that infinite matroids can be axiomatized in a way
that is very similar to finite matroids and permits duality. This was
previously thought impossible, since finitary infinite matroids must have
non-finitary duals. In this paper we illustrate the new theory by exhibiting
its implications for the cycle and bond matroids of infinite graphs. We also
describe their algebraic cycle matroids, those whose circuits are the finite
cycles and double rays, and determine their duals. Finally, we give a
sufficient condition for a matroid to be representable in a sense adapted to
infinite matroids. Which graphic matroids are representable in this sense
remains an open question.Comment: Figure correcte
Graph Theory
This workshop focused on recent developments in graph theory. These included in particular recent breakthroughs on nowhere-zero flows in graphs, width parameters, applications of graph sparsity in algorithms, and matroid structure results
- …