Publication

Packing the Boolean lattice with copies of a poset

Related publications (33)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Multiple-field based code generator and decoder for communications systems

Mohammad Amin Shokrollahi, Lorenz Minder

A method of encoding data for transmission from a source to a destination over a communications channel is provided. The method operates on an ordered set of input symbols and includes generating a plurality of redundant symbols from the input symbols base ...

2016

Small subset sums

Gergely Ambrus

Let parallel to.parallel to be a norm in R-d whose unit ball is B. Assume that V subset of B is a finite set of cardinality n, with Sigma(v is an element of V) v = 0. We show that for every integer k with 0

Elsevier Science Inc2016

Remarks on Schur's conjecture

János Pach, Filip Moric

Let P be a set of n > d points in for d >= 2. It was conjectured by Zvi Schur that the maximum number of (d-1)-dimensional regular simplices of edge length diam(P), whose every vertex belongs to P, is n. We prove this statement under the condition that any ...

Elsevier Science Bv2015

Cross-Intersecting Families of Vectors

János Pach, Gábor Tardos

Given a sequence of positive integers , let denote the family of all sequences of positive integers such that for all . Two families of sequences (or vectors), , are said to be -cross-intersecting if no matter how we select and , there are at least distinc ...

Springer Japan Kk2015

Linear Growth for Certain Elliptic Fibrations

Pierre Francis André Le Boudec

We prove that the number of rational points of bounded height on certain del Pezzo surfaces of degree 1 defined over Q grows linearly, as predicted by Manin's conjecture. ...

Oxford University Press2015

Some New Results On Differential Inclusions For Differential Forms

Bernard Dacorogna, Olivier Kneuss, Saugata Bandyopadhyay

In this article we study some necessary and sufficient conditions for the existence of solutions in W-0(1,infinity) (Omega; Lambda(k)) of the differential inclusion d omega is an element of E a.e. in Omega where E subset of Lambda(k+1) is a prescribed set. ...

Amer Mathematical Soc2015

An extremal problem on crossing vectors

Bartosz Maria Walczak, Michal Lason

For positive integers w and k, two vectors A and B from Z(w) are called k-crossing if there are two coordinates i and j such that A[i] - B[i] >= k and B[j] - A[j] >= k. What is the maximum size of a family of pairwise 1-crossing and pairwise non-k-crossing ...

Academic Press Inc Elsevier Science2014

Affine congruences and rational points on a certain cubic surface

Pierre Francis André Le Boudec

We establish estimates for the number of solutions of certain affine congruences. These estimates are then used to prove Manin's conjecture for a cubic surface split over Q whose singularity type is D-4. This improves on a result of Browning and answers a ...

Mathematical Science Publ2014

Diameter Graphs in R-4

Andrei Kupavskii

A diameter graph in is a graph whose set of vertices is a finite subset of and whose set of edges is formed by pairs of vertices that are at diameter apart. This paper is devoted to the study of different extremal properties of diameter graphs in and on a ...

Springer2014

Optimal asymptotic bounds for spherical designs

Maryna Viazovska

In this paper we prove the conjecture of Korevaar and Meyers: for each N≥cdtd, there exists a spherical t-design in the sphere Sd consisting of N points, where cd is a constant depending only on d. ...

2013