Related papers: The Hilbert 16-th problem and an estimate for cycl…

In this paper, we prove that, given a clique-width $k$-expression of an $n$-vertex graph, \textsc{Hamiltonian Cycle} can be solved in time $n^{\mathcal{O}(k)}$. This improves the naive algorithm that runs in time $n^{\mathcal{O}(k^2)}$ by…

We establish a regularity result for optimal sets of the isoperimetric problem with double density under mild ($\alpha$-)H\"older regularity assumptions on the density functions. Our main Theorem improves some previous results and allows to…

In this paper, we examine the regularity of the solutions to the double-divergence equation. We establish improved H\"older continuity as solutions approach their zero level-sets. In fact, we prove that $\alpha$-H\"older continuous…

We say that a $k$-uniform hypergraph $C$ is a Hamilton cycle of type $\ell$, for some $1\le \ell \le k$, if there exists a cyclic ordering of the vertices of $C$ such that every edge consists of $k$ consecutive vertices and for every pair…

We present the first local problem that shows a super-constant separation between the classical randomized LOCAL model of distributed computing and its quantum counterpart. By prior work, such a separation was known only for an artificial…

The investigation of conditions guaranteeing the appearance of cycles of certain lengths is one of the most well-studied topics in graph theory. In this paper we consider a problem of this type which asks, for fixed integers ${\ell}$ and…

In this work, we generalize Sacks-Uhlenbeck's existence result for harmonic spheres, constructing for $n \ge 2$, regular, non-trivial, $n$-harmonic $n$-spheres into suitable target manifolds. We obtain an infinite family of new…

Let $G$ be a graph obtained as the union of some $n$-vertex graph $H_n$ with minimum degree $\delta(H_n)\geq\alpha n$ and a $d$-dimensional random geometric graph $G^d(n,r)$. We investigate under which conditions for $r$ the graph $G$ will…

Local Hochschild, cyclic Homology and K-theory were introduced by N. Teleman in [10] with the purpose of unifying different settings of the index theorem. This paper is one of the research topics announced in [10], {\S}10. The definition of…

Symmetries occur naturally in CSP or SAT problems and are not very difficult to discover, but using them to prune the search space tends to be very challenging. Indeed, this usually requires finding specific elements in a group of…

The log-density method is a powerful algorithmic framework which in recent years has given rise to the best-known approximations for a variety of problems, including Densest-$k$-Subgraph and Bipartite Small Set Vertex Expansion. These…

We prove a new, large family of area laws in general relativity, which apply to certain classes of untrapped surfaces that we dub generalized holographic screens. Our family of area laws contains, as special cases, the area laws for…

We compute the completion of the local ring of the Hilbert scheme of degree $n+1$ subschemes of $\mathbb{A}^n$ at the point corresponding to the ideal $\langle x_1,\ldots,x_n\rangle^2$, and describe the completion of the universal family.…

Let $A$ be a commutative algebra over the field ${\mathbb F}_2 = {\mathbb Z}/2$. We show that there is a natural algebra homomorphism $\ell (A) \to HC^-_*(A)$ which is an isomorphism when $A$ is a smooth algebra. Thus, the functor $\ell$…

Square Heffter arrays are $n\times n$ arrays such that each row and each column contains $k$ filled cells, each row and column sum is divisible by $2nk+1$ and either $x$ or $-x$ appears in the array for each integer $1\leq x\leq nk$.…

A linear cycle in a hypergraph $H$ is a cyclic sequence of hyperedges such that two consecutive hyperedges intersect in exactly one element and two nonconsecutive hyperedges are disjoint and $\alpha(H)$ denotes the size of a largest…

We show that for a smooth, projective variety X defined over a number field K, cyclic homology with coefficients in the ring of infinite adeles of K, provides the right theory to obtain, using the lambda-operations, Serre's archimedean…

Suppose $1\le \ell <k$ such that $(k-\ell)\nmid k$. Given an $n$-vertex $k$-uniform hypergraph $\mathcal H$, for all $k/2<\ell< 3k/4$ and sufficiently large $n\in (k-\ell)\mathbb N$, we prove that if $\mathcal H$ has minimum co-degree at…

Geometric hitting set problems, in which we seek a smallest set of points that collectively hit a given set of ranges, are ubiquitous in computational geometry. Most often, the set is discrete and is given explicitly. We propose new…

Finding a cycle of lowest weight that represents a homology class in a simplicial complex is known as homology localization (HL). Here we address this NP-complete problem using parameterized complexity theory. We show that it is W[1]-hard…