m
• E

F Nous contacter

0

# Documents  05B35 | enregistrements trouvés : 50

O

P Q

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## Surveys in Combinatorics 2009St Andrews # July 2009 Huczynska, Sophie ; Mitchell, James D. ; Roney-Dougal, Colva M. | Cambridge University Press 2009

Congrès

- VII-327 p.
ISBN 978-0-521-74173-6

London mathematical society lecture note series , 0365

Localisation : Collection 1er étage

combinatoires # théorie des graphes

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## Théorie des matroïdesrencontre frano-britanique actes Mai 14-15 Bruter, C. P. | Springer-Verlag 1971

Congrès

ISBN 978-3-540-05545-7

Lecture notes in mathematics , 0211

Localisation : Collection 1er étage

dualité en théorie des matroïdes # espace d'indépendance transversal # matroïde non-séparable # matroïde représentable en espace vectoriel sur corps # plan de bloc # problème extrémal # représentabilité et transversalité de matroïde # représentation sur un corps de matroïde # roue et mouvement giratoire # théorie transversale généralisée

05B35

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## Matroid theory :AMS-IMS-SIAM joint conference research conference#July 2-6 Bonin, Joseph E. ; Oxley, James G. ; Servatius, Brigitte | American Mathematical Society 1996

Congrès

- 418 p.
ISBN 978-0-8218-0508-4

Contemporary mathematics , 0197

Localisation : Collection 1er étage

K-mineur # U-mineur # application électrique # approximation aléatoire du nombre des bases # connexité pour matroïde # géométrie appliquée discrète # matroïde Coxeter de Gelfand et autres # matroïde binaire # matroïde monotactique # matroïde représentable # paire de matroïdes orientés # polynôme caractéristique grilloïde # rigidité squelettique de p.l.-sphère # séparation matroïde # théorie # théorie des matroïdes # théorème min-max

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## Algebraic geometry and its applications Nikol'Skii, S. M. ; Volkov, E. A. | American Mathematical Society 1986

Congrès

- 251 p.
ISBN 978-0-8218-3092-5

Proceedings of the Steklov institute of mathematics , 0165

Localisation : Collection 1er étage

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## Matroid theorycolloque on the matroid theory held in szeged,hungary,aug. 29 - sept. 4,1982 Lovasz, L. ; Recski, A. | North-Holland 1985

Congrès

ISBN 978-0-444-87580-8

Colloquia mathematica societatis janos bolyai , 0040

Localisation : Colloque 1er étage (SZEG)

05B35

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## Séminaire Bourbaki, Vol. 1980/81:exposés 561- 578, avec table par nom d'auteurs de 1967-68 à 1980-81 | Springer-Verlag 1981

Congrès

- 299 p.
ISBN 978-3-540-11176-4

Lecture notes in mathematics , 0901

Localisation : Collection 1er étage

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## The coset leader weight enumerator of the code of the twisted cubic Pellikaan, Ruud | CIRM H

Multi angle

Research talks

In general the computation of the weight enumerator of a code is hard and even harder so for the coset leader weight enumerator. Generalized Reed Solomon codes are MDS, so their weight enumerators are known and its formulas depend only on the length and the dimension of the code. The coset leader weight enumerator of an MDS code depends on the geometry of the associated projective system of points. We consider the coset leader weight enumerator of $F_{q}$-ary Generalized Reed Solomon codes of length q + 1 of small dimensions, so its associated projective system is a normal rational curve. For instance in case of the $\left [ q+1,3,q-1 \right ]_{q}$ code where the associated projective system of points consists of the q + 1 points of a plane conic, the answer depends whether the characteristic is odd or even. If the associated projective system of points of a $\left [ q+1,4,q-2 \right ]_{q}$ code consists of the q + 1 points of a twisted cubic, the answer depends on the value of the characteristic modulo 6. In general the computation of the weight enumerator of a code is hard and even harder so for the coset leader weight enumerator. Generalized Reed Solomon codes are MDS, so their weight enumerators are known and its formulas depend only on the length and the dimension of the code. The coset leader weight enumerator of an MDS code depends on the geometry of the associated projective system of points. We consider the coset leader weight enumerator ...

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## Generalizations of Crapo's Beta Invariant Gordon, Gary ; McMahon, Liz | CIRM H

Multi angle

Research talks

Crapo's beta invariant was defined by Henry Crapo in the 1960s. For a matroid $M$, the invariant $\beta(M)$ is the non-negative integer that is the coefficient of the $x$ term of the Tutte polynomial. Crapo proved that $\beta(M)>0$ if and only if $M$ is connected and $M$ is not a loop, and Brylawski proved that $M$ is the matroid of a series-parallel network if and only if $M$ is a co-loop or $\beta(M)=1.$ In this talk, we present several generalizations of the beta invariant to combinatorial structures that are not matroids. We concentrate on posets, chordal graphs, and finite subsets of Euclidean space. In each case, our definition of $\beta$ measures the number of "interior'' elements. Crapo's beta invariant was defined by Henry Crapo in the 1960s. For a matroid $M$, the invariant $\beta(M)$ is the non-negative integer that is the coefficient of the $x$ term of the Tutte polynomial. Crapo proved that $\beta(M)>0$ if and only if $M$ is connected and $M$ is not a loop, and Brylawski proved that $M$ is the matroid of a series-parallel network if and only if $M$ is a co-loop or $\beta(M)=1.$ In this talk, we present several ...

05B35

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## Delta-matroids as subsystems of sequences of Higgs lifts Bonin, Joseph E. | CIRM H

Multi angle

Research talks

Delta-matroids generalize matroids. In a delta-matroid, the counterparts of bases, which are called feasible sets, can have different sizes, but they satisfy a similar exchange property in which symmetric differences replace set differences. One way to get a delta-matroid is to take a matroid L, a quotient Q of L, and all of the Higgs lifts of Q toward L; the union of the sets of bases of these Higgs lifts is the collection of feasible sets of a delta-matroid, which we call a full Higgs lift delta-matroid.

We give an excluded-minor characterization of full Higgs lift delta-matroids within the class of all delta-matroids. We introduce a class of full Higgs lift delta-matroids that arise from lattice paths and that generalize lattice path matroids. It follows from results of Bouchet that all delta-matroids can be obtained from full Higgs lift delta-matroids by removing certain feasible sets; to address which feasible sets can be removed, we give an excluded-minor characterization of delta-matroids within the more general structure of set systems. This result in turn yields excluded-minor characterizations of a number of related classes of delta-matroids.
(This is joint work with Carolyn Chun and Steve Noble.)
Delta-matroids generalize matroids. In a delta-matroid, the counterparts of bases, which are called feasible sets, can have different sizes, but they satisfy a similar exchange property in which symmetric differences replace set differences. One way to get a delta-matroid is to take a matroid L, a quotient Q of L, and all of the Higgs lifts of Q toward L; the union of the sets of bases of these Higgs lifts is the collection of feasible sets of a ...

05B35

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## How many cubes are orientable? Da Silva, Ilda P. F. | CIRM H

Multi angle

Research talks

A cube is a matroid over $C^n=\{-1,+1\}^n$ that contains as circuits the usual rectangles of the real affine cube packed in such a way that the usual facets and skew-facets are hyperplanes of the matroid.
How many cubes are orientable? So far, only one: the oriented real affine cube. We review the results obtained so far concerning this question. They follow two directions:
1) Identification of general obstructions to orientability in this class. (da Silva, EJC 30 (8), 2009, 1825-1832).
2) (work in collaboration with E. Gioan) Identification of algebraic and geometric properties of recursive families of non-negative integer vectors defining hyperplanes of the real affine cube and the analysis of this question and of las Vergnas cube conjecture in small dimensions.
A cube is a matroid over $C^n=\{-1,+1\}^n$ that contains as circuits the usual rectangles of the real affine cube packed in such a way that the usual facets and skew-facets are hyperplanes of the matroid.
How many cubes are orientable? So far, only one: the oriented real affine cube. We review the results obtained so far concerning this question. They follow two directions:
1) Identification of general obstructions to orientability in this ...

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## Tverberg-type theorems with altered nerves De Loera, Jesus A. | CIRM H

Multi angle

Research talks

The classical Tverberg's theorem says that a set with sufficiently many points in $R^d$ can always be partitioned into m parts so that the (m - 1)-simplex is the (nerve) intersection pattern of the convex hulls of the parts. Our main results demonstrate that Tverberg's theorem is but a special case of a much more general situation. Given sufficiently many points, any tree or cycle, can also be induced by at least one partition of the point set. The proofs require a deep investigation of oriented matroids and order types.
(Joint work with Deborah Oliveros, Tommy Hogan, Dominic Yang (supported by NSF).)
The classical Tverberg's theorem says that a set with sufficiently many points in $R^d$ can always be partitioned into m parts so that the (m - 1)-simplex is the (nerve) intersection pattern of the convex hulls of the parts. Our main results demonstrate that Tverberg's theorem is but a special case of a much more general situation. Given sufficiently many points, any tree or cycle, can also be induced by at least one partition of the point set. ...

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## The concatenation operation for uniform oriented matroids and simplicial (or simple) polytopes Lawrence, Jim | CIRM H

Multi angle

Research talks

Some problems connected with the concatenation operation will be described.

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## Approximating clutters with matroids De Mier, Anna | CIRM H

Multi angle

Research talks

There are several clutters (antichains of sets) that can be associated with a matroid, as the clutter of circuits, the clutter of bases or the clutter of hyperplanes. We study the following question: given an arbitrary clutter $\Lambda$, which are the matroidal clutters that are closest to $\Lambda$? To answer it we first decide on the meaning of closest, and select one of the different matroidal clutters.

We show that for almost all reasonable choices above there is a finite set of matroidal clutters that approximate $\Lambda$ and, moreover, that $\Lambda$ can be recovered from them by a suitable operation. We also link our work to results in lattice theory, and give algorithmic procedures to compute the approximations. We are also interested in the same questions when we further require that both the original clutter and the matroidal approximations have the same ground set. In this situation, it is often the case that $\Lambda$ cannot be recovered by the approximating matroidal clutters (if they exist), but we can characterize when it does.

Although our initial interest was in matroids, our framework is general and applies in any situation when one wishes to decompose the clutter $\Lambda$ with members of a favourite family of clutters, not necessarily a matroidal one.
(Joint work with Jaume Martí-Farré and José Luis Ruiz.)
There are several clutters (antichains of sets) that can be associated with a matroid, as the clutter of circuits, the clutter of bases or the clutter of hyperplanes. We study the following question: given an arbitrary clutter $\Lambda$, which are the matroidal clutters that are closest to $\Lambda$? To answer it we first decide on the meaning of closest, and select one of the different matroidal clutters.

We show that for almost all reasonable ...

05B35

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## A matroid extension result Oxley, James G. | CIRM H

Multi angle

Research talks

Let $(A,B)$ be a $3$-separation in a matroid $M$. If $M$ is representable, then, in the underlying projective space, there is a line where the subspaces spanned by $A$ and $B$ meet, and $M$ can be extended by adding elements from this line. In general, Geelen, Gerards, and Whittle proved that $M$ can be extended by an independent set $\{p,q\}$ such that $\{p,q\}$ is in the closure of each of $A$ and $B$. In this extension, each of $p$ and $q$ is freely placed on the line $L$ spanned by $\{p,q\}$. This talk will discuss a result that gives necessary and sufficient conditions under which a fixed element can be placed on $L$. Let $(A,B)$ be a $3$-separation in a matroid $M$. If $M$ is representable, then, in the underlying projective space, there is a line where the subspaces spanned by $A$ and $B$ meet, and $M$ can be extended by adding elements from this line. In general, Geelen, Gerards, and Whittle proved that $M$ can be extended by an independent set $\{p,q\}$ such that $\{p,q\}$ is in the closure of each of $A$ and $B$. In this extension, each of $p$ and $q$ is ...

05B35

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## Handbook of discrete and computational geometry Goodman, Jacob E. ; O'Rourke, Joseph ; Toth, Csaba D. | CRC Press 2018

Ouvrage

- xxi; 1927 p.
ISBN 978-1-4987-1139-5

Discrete mathematics and its applications

Localisation : Ouvrage RdC (HAND)

géométrie discrète # géométrie computationnelle # traitement des données

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## Introduction to tropical geometry Maclagan, Diane ; Sturmfels, Bernd | American Mathematical Society 2015

Ouvrage

- xii; 363 p.
ISBN 978-0-8218-5198-2

Graduate studies in mathematics , 0161

Localisation : Collection 1er étage;Réserve

géométrie tropicale

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## Topics in hyperplane arrangements, polytopes and box-splines De Concini, Corrado ; Procesi, Claudio | Springer 2011

Ouvrage

- xx; 384 p.
ISBN 978-0-387-78962-0

Universitext

Localisation : Ouvrage RdC (DECO)

polytôpes # matroïdes # spline # fonction de partition # arrangement hyperplan

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## The mutually beneficial relationship of graphs and matrices Brualdi, Richard A. | American Mathematical Society;National science foundation 2011

Ouvrage

- ix; 96 p.
ISBN 978-0-8218-5315-3

CBMS regional conference series in mathematics , 0115

Localisation : Collection 1er étage

théorie des graphes # matrices # analyse combinatoire # algèbre linéaire

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## Matroids: a geometric introduction Gordon, Gary ; McNulty, Jennifer | Cambridge University Press 2012

Ouvrage

- xv; 393 p.
ISBN 978-0-521-14568-8

Localisation : Ouvrage RdC (GORD)

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## On the shape of a pure O-sequence Boij, Mats ; Migliore, Juan C. ; Miro-Roig, Rosa M. ; Nagel, Uwe ; Zanello, Fabrizio | American Mathematical Society 2011

Ouvrage

- vii; 78 p.
ISBN 978-0-8218-6910-9

Memoirs of the american mathematical society , 1024

Localisation : Collection 1er étage

algèbre de Artin # ensemble partiellement ordonné # algèbre commutative # algèbre de Gorenstein # énumération # g-élément # propriété de Lefschetz # sysème inverse de Macaulay

#### Filtrer

##### Codes MSC

Ressources Electroniques (Depuis le CIRM)

Books & Print journals

Recherche avancée

0
Z