Publications related to Order dimension

A simple proof for a forbidden subposet problem

The poset Y-k,Y-2 consists of k + 2 distinct elements x(1), x(2), ..., x(k), y(1), y(2), such that x(1)

ELECTRONIC JOURNAL OF COMBINATORICS2020

New Results in Integer and Lattice Programming

An integer program (IP) is a problem of the form

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

,

b \in \Z^m

,

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

EPFL2020

Improved Ramsey-type results for comparability graphs

Istvan Tomon, Dániel József Korándi

Several discrete geometry problems are equivalent to estimating the size of the largest homogeneous sets in graphs that happen to be the union of few comparability graphs. An important observation for such results is that if G is an n-vertex graph that is ...

CAMBRIDGE UNIV PRESS2020

Conformal 3-Point Functions and the Lorentzian OPE in Momentum Space

Marc Gillioz

In conformal field theory in Minkowski momentum space, the 3-point correlation functions of local operators are completely fixed by symmetry. Using Ward identities together with the existence of a Lorentzian operator product expansion (OPE), we show that t ...

SPRINGER2020

On 2-Level Polytopes Arising In Combinatorial Settings

Yuri Faenza, Manuel Francesco Aprile, Alfonso Bolívar Cevallos Manzano

2-level polytopes naturally appear in several areas of pure and applied mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and statistics. In this paper, we present a study of some 2-level polytopes arisi ...

SIAM PUBLICATIONS2018

Towards Stationary Time-Vertex Signal Processing

Pierre Vandergheynst, Nathanaël Perraudin, Andreas Loukas, Francesco Grassi

Graph-based methods for signal processing have shown promise for the analysis of data exhibiting irregular structure, such as those found in social, transportation, and sensor networks. Yet, though these systems are often dynamic, state-of-the-art methods ...

Ieee2017

Towards stationary time-vertex signal processing

Pierre Vandergheynst, Nathanaël Perraudin, Andreas Loukas, Francesco Grassi

Graph-based methods for signal processing have shown promise for the analysis of data exhibiting irregular structure, such as those found in social, transportation, and sensor networks. Yet, though these systems are often dynamic, state-of-the-art methods ...

2016

The representation theory of finite sets and correspondences

Jacques Thévenaz, Serge Bouc

We investigate correspondence functors, namely the functors from the category of finite sets and correspondences to the category of k-modules, where k is a commutative ring. They have various specific properties which do not hold for other types of functor ...

2015

Online Coloring of Comparability Graphs: some results

Benjamin Leroy-Beaulieu

We study online partitioning of posets from a graph theoretical point of view, which is coloring and cocoloring in comparability graphs. For the coloring problem, we analyse the First-Fit algorithm and show a ratio of

O(\sqrt{n})

; furthermore, we devise ...

2007

Order dimension

Graph Chatbot

Chat with Graph Search

A simple proof for a forbidden subposet problem

New Results in Integer and Lattice Programming

Improved Ramsey-type results for comparability graphs

Conformal 3-Point Functions and the Lorentzian OPE in Momentum Space

On 2-Level Polytopes Arising In Combinatorial Settings

Towards Stationary Time-Vertex Signal Processing

Towards stationary time-vertex signal processing

The representation theory of finite sets and correspondences

Online Coloring of Comparability Graphs: some results

Improved Ramsey-type results for comparability graphs

On 2-Level Polytopes Arising In Combinatorial Settings

Online Coloring of Comparability Graphs: some results

Towards stationary time-vertex signal processing

New Results in Integer and Lattice Programming

Conformal 3-Point Functions and the Lorentzian OPE in Momentum Space

A simple proof for a forbidden subposet problem

The representation theory of finite sets and correspondences

Towards Stationary Time-Vertex Signal Processing