AI Chat AI Image Generator AI Video Text to Speech

Refuting conjectures in extremal combinatorics via linear programming

03/13/2019
∙
by   Adam Zsolt Wagner, et al.
∙
0
∙

We apply simple linear programming methods and an LP solver to refute a number of open conjectures in extremal combinatorics.

READ FULL TEXT

page 1

page 2

page 3

page 4

Related Research

research
∙ 01/15/2019

A linear programming approach to the tracking of partials

A new approach to the tracking of sinusoidal chirps using linear program...
0 Nicholas Esterer, et al. ∙
research
∙ 07/25/2019

Integrality Gap of the Vertex Cover Linear Programming Relaxation

We give a characterization result for the integrality gap of the natural...
0 Mohit Singh, et al. ∙
research
∙ 12/13/2017

Ellipsoid Method for Linear Programming made simple

In this paper, ellipsoid method for linear programming is derived using ...
0 Sanjeev Saxena, et al. ∙
research
∙ 12/22/2017

A simple introduction to Karmarkar's Algorithm for Linear Programming

An extremely simple, description of Karmarkar's algorithm with very few ...
0 Sanjeev Saxena, et al. ∙
research
∙ 07/28/2021

Dynamic Programming and Linear Programming for Odds Problem

This paper discusses the odds problem, proposed by Bruss in 2000, and it...
0 Sachika Kurokawa, et al. ∙
research
∙ 02/01/2023

Orbit-finite linear programming

An infinite set is orbit-finite if, up to permutations of the underlying...
0 Arka Ghosh, et al. ∙
research
∙ 01/17/2022

Learning to Reformulate for Linear Programming

It has been verified that the linear programming (LP) is able to formula...
10 Xijun Li, et al. ∙

Please sign up or login with your details

Forgot password? Click here to reset

Out of credits

Refill your membership to continue using DeepAI

Stripe
Paypal