Tuan Tran, Minimum saturated families of sets
Room B232 IBS (기초과학연구원)A family
A family
Main purpose of this talk is to introduce a connection between restriction estimates for cones and point-sphere incidence theorems in the finite field setting. First, we review the finite field …
Specifying a computational problem requires fixing encodings for input and output: encoding graphs as adjacency matrices, characters as integers, integers as bit strings, and vice versa. For such discrete data, the actual encoding …
We prove that if
Erdős and Pósa proved in 1965 that there is a duality between the maximum size of a packing of cycles and the minimum size of a vertex set hitting all …
Graph saturation is one of the oldest areas of investigation in extremal combinatorics. A graph
We propose a theoretical analysis of recommendation systems in an online setting, where items are sequentially recommended to users over time. In each round, a user, randomly picked from a …
In 1975, Erdős asked the following question: what is the smallest function
We show that that the maximum number of of edges in a
In this talk we will have a brief introduction to oriented matroids and their relation to real-representability.