Joonkyung Lee (이준경), On some properties of graph norms
Room B232 IBS (기초과학연구원)For a graph
10 events found.
Seminars and Colloquiums
Pascal Gollin, A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
Room B232 IBS (기초과학연구원)Given a cardinal
Sun Kim (김선), Two identities in Ramanujan’s Lost Notebook with Bessel function series
Room 1401, Bldg. E6-1, KAISTOn page 335 in his lost notebook, Ramanujan recorded without proofs two identities involving finite trigonometric sums and doubly infinite series of Bessel functions. We proved each of these identities under three different interpretations for the double series, and showed that they are intimately connected with the classical circle and divisor problems in number theory. …
Tony Huynh, Stable sets in graphs with bounded odd cycle packing number
Room B232 IBS (기초과학연구원)It is a classic result that the maximum weight stable set problem is efficiently solvable for bipartite graphs. The recent bimodular algorithm of Artmann, Weismantel and Zenklusen shows that it is also efficiently solvable for graphs without two disjoint odd cycles. The complexity of the stable set problem for graphs without
Ruth Luo, Induced Turán problems for hypergraphs
Room B232 IBS (기초과학연구원)Let
Frédéric Meunier, Topological bounds for graph representations over any field
Room B232 IBS (기초과학연구원)Haviv (European Journal of Combinatorics, 2019) has recently proved that some topological lower bounds on the chromatic number of graphs are also lower bounds on their orthogonality dimension over
Jakub Gajarský, First-order interpretations of bounded expansion classes
Room B232 IBS (기초과학연구원)The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard in general tractable. In particular, the model-checking problem for first-order logic is fixed-parameter tractable over such graph classes. With the aim of generalizing such results to dense graphs, we introduce classes of graphs with structurally bounded expansion, defined as first-order interpretations of …
Hong Liu, A proof of Mader’s conjecture on large clique subdivisions in
Room 1401, Bldg. E6-1, KAIST
Given any integers
Attila Joó, Base partition for finitary-cofinitary matroid families
Room B232 IBS (기초과학연구원)Let
Jaiung Jun (전재웅), The Hall algebra of the category of matroids
Room 1401, Bldg. E6-1, KAISTTo an abelian category A satisfying certain finiteness conditions, one can associate an algebra H_A (the Hall algebra of A) which encodes the structures of the space of extensions between objects in A. For a non-additive setting, Dyckerhoff and Kapranov introduced the notion of proto-exact categories, as a non-additive generalization of an exact category, which …