Related papers: Lower Bounds for Testing Directed Acyclicity in th…

In this note, we prove that there exists a universal constant $c=\frac{43}{50}$ such that for every $k\in \mathbb{N}$ and every $d<k/2$, every $k$-uniform hypergraph on $n$ vertices and with minimum $d$-degree at least…

In this work, we prove a $\tilde{\Omega}(\lg^{3/2} n )$ unconditional lower bound on the maximum of the query time and update time for dynamic data structures supporting reachability queries in $n$-node directed acyclic graphs under edge…

We show that a large fraction of the data-structure lower bounds known today in fact follow by reduction from the communication complexity of lopsided (asymmetric) set disjointness. This includes lower bounds for: * high-dimensional…

We initiate the study of quantum property testing in sparse directed graphs, and more particularly in the unidirectional model, where the algorithm is allowed to query only the outgoing edges of a vertex. In the classical unidirectional…

An important theorem by Timofte states that nonnegativity of real $n$-variate symmetric polynomials of degree $d$ can be decided at test sets given by all points with at most $\lfloor\frac{d}{2}\rfloor$ distinct components. However, if the…

We show that the minimum number of orientations of the edges of the n-vertex complete graph having the property that every triangle is made cyclic in at least one of them is $\lceil\log_2(n-1)\rceil$. More generally, we also determine the…

We prove the uniform boundedness of all solutions for a general class of Dirichlet anisotropic elliptic problems of the form $$-\Delta_{\overrightarrow{p}}u+\Phi_0(u,\nabla u)=\Psi(u,\nabla u) +f $$ on a bounded open subset $\Omega\subset…

In $r$-neighbor bootstrap percolation on the vertex set of a graph $G$, a set $A$ of initially infected vertices spreads by infecting, at each time step, all uninfected vertices with at least $r$ previously infected neighbors. When the…

For a directed graph $G$, let $\mathrm{mindeg}(G)$ be the minimum among in-degrees and out-degrees of all vertices of $G$. It is easy to see that $G$ contains a directed cycle of length at least $\mathrm{mindeg}(G)+1$. In this note, we show…

We prove an asymptotic formula for the number of orientations with given out-degree (score) sequence for a graph $G$. The graph $G$ is assumed to have average degrees at least $n^{1/3 + \varepsilon}$ for some $\varepsilon > 0$, and to have…

We investigate the number of maximal independent set queries required to reconstruct the edges of a hidden graph. We show that randomised adaptive algorithms need at least $\Omega(\Delta^2 \log(n / \Delta) / \log \Delta)$ queries to…

Let D be a directed graph with vertex set V and order n. An anti-directed hamiltonian cycle H in D is a hamiltonian cycle in the graph underlying D such that no pair of consecutive arcs in H form a directed path in D. An anti-directed…

In Euclidean space we study surfaces with constant anisotropic mean curvature $\Lambda$ of the Dirichlet energy $\int_\Omega( |Du|^2+\Lambda u)$. We prove the existence of non-rotational surfaces with $\Lambda=0$ and foliated by a…

We establish a mixed observability inequality for a class of degenerate hyperbolic equations on the cylindrical domain $\Omega = \mathbb{T} \times (0,1)$ with mixed Neumann Dirichlet boundary conditions. The degeneracy acts only in the…

We study the existence of directed Hamilton cycles in random digraphs with $m$ edges where we condition on minimum in- and out-degree $\d \ge k+1$, where $k \ge 1$. Denote such a random graph by $D_{n,m}^{(\delta\geq k+1)}$. Let $m=cn$ and…

Consider an orientable compact surface in three dimensional Euclidean space with minimum total absolute curvature. If the Gaussian curvature changes sign to finite order and satisfies a nondegeneracy condition along closed asymptotic…

In this paper, we prove the existence of nontrivial unbounded domains $\Omega\subset\mathbb{R}^{n+1},n\geq1$, bifurcating from the straight cylinder $B\times\mathbb{R}$ (where $B$ is the unit ball of $\mathbb{R}^n$), such that the…

We discuss the inverse problem of determining the, possibly anisotropic, conductivity of a body $\Omega\subset\mathbb{R}^{n}$ when the so-called Neumann-to-Dirichlet map is locally given on a non empty curved portion $\Sigma$ of the…

In the standard CONGEST model for distributed network computing, it is known that "global" tasks such as minimum spanning tree, diameter, and all-pairs shortest paths, consume large bandwidth, for their running-time is…

We study the equivalence testing problem where the goal is to determine if the given two unknown distributions on $[n]$ are equal or $\epsilon$-far in the total variation distance in the conditional sampling model (CFGM, SICOMP16; CRS,…