Publications associées à Small subset sums

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

On some algebraic and extremal problems in discrete geometry

Seyed Hossein Nassajianmojarrad

In the present thesis, we delve into different extremal and algebraic problems arising from combinatorial geometry. Specifically, we consider the following problems. For any integer

n\ge 3

, we define

e(n)

to be the minimum positive integer such that an ...

EPFL2017

General Proximal Gradient Method: A Case for Non-Euclidean Norms

Volkan Cevher, Ya-Ping Hsieh, Marwa El Halabi, Cong Bang Vu, Van Quang Nguyen

In this paper, we consider composite convex minimization problems. We advocate the merit of considering Generalized Proximal gradient Methods (GPM) where the norm employed is not Euclidean. To that end, we show the tractability of the general proximity ope ...

2017

A size-sensitive inequality for cross-intersecting families

Andrei Kupavskii

Two families A and B, of k-subsets of an n-set are called cross intersecting if A boolean AND B not equal phi for all A,B epsilon b. Strengthening the classical ErclOs-Ko-Rado theorem, Pyber proved that vertical bar A vertical bar vertical bar B vertical b ...

Academic Press Ltd- Elsevier Science Ltd2017

Uniform s-Cross-Intersecting Families

Andrei Kupavskii

In this paper we study a question related to the classical Erdos-Ko-Rado theorem, which states that any family of k-element subsets of the set [n] = {1,..., n} in which any two sets intersect has cardinality at most ((n-1)(k-1)). We say that two non-empty ...

Cambridge Univ Press2017

Space lower bounds for low-stretch greedy embeddings

Christos Kalaitzis

Greedy (geometric) routing is an important paradigm for routing in communication networks. It uses an embedding of the nodes of a network into points of a space (e.g., R-d) equipped with a distance function (e.g., the Euclidean distance l(2)) and uses as a ...

Elsevier Science Bv2016

Approximation algorithms for geometric dispersion

Alfonso Bolívar Cevallos Manzano

The most basic form of the max-sum dispersion problem (MSD) is as follows: given n points in R^q and an integer k, select a set of k points such that the sum of the pairwise distances within the set is maximal. This is a prominent diversity problem, with w ...

EPFL2016

Distinct Values Of Bilinear Forms On Algebraic Curves

Frank de Zeeuw, Adrian Claudiu Valculescu

Let B-M : C x C -> C be a bilinear form B-M(p, q) - p(T)Mq, with an invertible matrix M is an element of C-2x2. We prove that any finite set S contained in an irreducible algebraic curve C of degree d in C determines Omega(d)(vertical bar S vertical bar(4/ ...

Univ Calgary, Dept Math & Statistics2016

Vector-Based 3D Graphic Statics (Part II): Construction of Force Diagrams

Corentin Jean Dominique Fivet, Pierluigi D'Acunto

This paper presents an approach to the extension of graphic statics force diagrams to the third dimension. The main focus is to build 3D force diagrams out of vectors, so that each edge in the form diagram corresponds to two parallel vectors in the force d ...

IASS2016

On some algebraic and extremal problems in discrete geometry

Seyed Hossein Nassajianmojarrad

In the present thesis, we delve into different extremal and algebraic problems arising from combinatorial geometry. Specifically, we consider the following problems. For any integer

n\ge 3

, we define

e(n)

to be the minimum positive integer such that an ...

EPFL2017

Small subset sums

Graph Chatbot

Chattez avec Graph Search

On some algebraic and extremal problems in discrete geometry

General Proximal Gradient Method: A Case for Non-Euclidean Norms

The cost of omnidirectionality: extracting and labelling the echoes

A size-sensitive inequality for cross-intersecting families

Uniform s-Cross-Intersecting Families

Space lower bounds for low-stretch greedy embeddings

Approximation algorithms for geometric dispersion

Distinct Values Of Bilinear Forms On Algebraic Curves

Simultaneous Approximation of Polynomials

Vector-Based 3D Graphic Statics (Part II): Construction of Force Diagrams

A size-sensitive inequality for cross-intersecting families

On some algebraic and extremal problems in discrete geometry

General Proximal Gradient Method: A Case for Non-Euclidean Norms

The cost of omnidirectionality: extracting and labelling the echoes

Space lower bounds for low-stretch greedy embeddings

Approximation algorithms for geometric dispersion

Vector-Based 3D Graphic Statics (Part II): Construction of Force Diagrams

Distinct Values Of Bilinear Forms On Algebraic Curves

Simultaneous Approximation of Polynomials

Uniform s-Cross-Intersecting Families