Related papers: Irredundant intervals

The planar rigidity problem asks, given a set of m pairwise distances among a set P of n unknown points, whether it is possible to reconstruct P, up to a finite set of possibilities (modulo rigid motions of the plane). The celebrated…

Replicability requires that algorithmic conclusions remain consistent when rerun on independently drawn data. A central structural question is composition: given $k$ problems each admitting a $\rho$-replicable algorithm with sample…

A celebrated theorem of Kleitman in extremal combinatorics states that a collection of binary vectors in $\{0, 1\}^n$ with diameter $d$ has cardinality at most that of a Hamming ball of radius $d/2$. In this paper, we give an algebraic…

We study two extremal problems about subgraphs excluding a family $\F$ of graphs. i) Among all graphs with $m$ edges, what is the smallest size $f(m,\F)$ of a largest $\F$--free subgraph? ii) Among all graphs with minimum degree $\delta$…

Let $\Delta$ be a finite set and $G$ be a subgroup of $\operatorname{Sym}(\Delta)$. An irredundant base for $G$ is a sequence of points of $\Delta$ yielding a strictly descending chain of pointwise stabilisers, terminating with the trivial…

We present a framework for computing with input data specified by intervals, representing uncertainty in the values of the input parameters. To compute a solution, the algorithm can query the input parameters that yield more refined…

We consider the problem of sampling and approximately counting an arbitrary given motif $H$ in a graph $G$, where access to $G$ is given via queries: degree, neighbor, and pair, as well as uniform edge sample queries. Previous algorithms…

Let G be a finite group. By Riemann's Existence Theorem, braid orbits of generating systems of G with product 1 correspond to irreducible families of covers of the Riemann sphere with monodromy group G. Thus many problems on algebraic…

Let $(R,\mathfrak{m})$ be a Noetherian local ring of dimension $d > 0$. Let $I_\bullet = \{I_n\}_{n \in \mathbb{N}}$ be a graded family of $\mathfrak{m}$-primary ideals in $R$. We examine how far off from a polynomial can the length…

Hierarchical structure and repetition are prevalent in graphs originating from nature or engineering. These patterns can be represented by a class of parametric-structure graphs, which are defined by templates that generate structure by way…

Call a simple graph $H$ of order $n$ well-separable, if by deleting a separator set of size $o(n)$ the leftover will have components of size at most $o(n)$. We prove, that bounded degree well-separable spanning subgraphs are easy to embed:…

We adapt the Ping-Pong Lemma, which historically was used to study free products of groups, to the setting of the homeomorphism group of the unit interval. As a consequence, we isolate a large class of generating sets for subgroups of…

This paper initiates the study of I/O algorithms (minimizing cache misses) from the perspective of fine-grained complexity (conditional polynomial lower bounds). Specifically, we aim to answer why sparse graph problems are so hard, and why…

Consider a linear programming problem with n primal and m dual variables paired with n dual and m primal slack variables respectively, and aggregately denote these variables and slack variables as a vector z of length 2(n+m). Unlike…

Statistical inference for exponential-family models of random graphs with dependent edges is challenging. We stress the importance of additional structure and show that additional structure facilitates statistical inference. A simple…

A graph is reconstructible if it is determined up to isomorphism by the multiset of its proper induced subgraphs. The reconstruction conjecture postulates that every graph of order at least 3 is reconstructible. We show that interval graphs…

Graphs are extremely versatile and ubiquitous mathematical structures with potential to model a wide range of domains. For this reason, graph problems have been of interest since the early days of computer science. Some of these problems…

In this paper we provide an algorithm that generates a graph with given degree sequence uniformly at random. Provided that $\Delta^4=O(m)$, where $\Delta$ is the maximal degree and $m$ is the number of edges,the algorithm runs in expected…

We consider a natural generalization of scheduling $n$ jobs on $m$ parallel machines so as to minimize the makespan. In our extension the set of jobs is partitioned into several classes and a machine requires a setup whenever it switches…

We present a general framework of designing efficient dynamic approximate algorithms for optimization on undirected graphs. In particular, we develop a technique that, given any problem that admits a certain notion of vertex sparsifiers,…