Related papers: Gap Sequence of Cutting Sequence with Slope $\thet…

This paper considers a natural fault-tolerant shortest paths problem: for some constant integer $f$, given a directed weighted graph with no negative cycles and two fixed vertices $s$ and $t$, compute (either explicitly or implicitly) for…

Nowhere dense classes of graphs are very general classes of uniformly sparse graphs with several seemingly unrelated characterisations. From an algorithmic perspective, a characterisation of these classes in terms of uniform quasi-wideness,…

In this work, we introduce a vertex separator in trees known as a sweep-cover that is defined by an ancestor-descendent relationship with all nodes in the tree. We prove the recurrence relation of sweep-covers with $n$ subcovers $P_{\Delta,…

A string is said to be closed if its length is one, or if it has a non-empty factor that occurs both as a prefix and as a suffix of the string, but does not occur elsewhere. The notion of closed words was introduced by [Fici, WORDS 2011].…

Non-forking is one of the most important notions in modern model theory capturing the idea of a generic extension of a type (which is a far-reaching generalization of the concept of a generic point of a variety). To a countable first-order…

In signal analysis, among the effort of seeking for efficient representations of a signal into the basic ones of meaningful frequencies, to extract principal frequency components, consecutively one after another or $n$ at one time, is a…

To clarify the origin of the pseudogap and strange metal states as well as their mutual relationship in cuprate superconductors, a comprehensive study on the spectral function, Fermi surface, resistivity and dynamical spin susceptivity of…

Let CMSO denote the counting monadic second order logic of graphs. We give a constructive proof that for some computable function $f$, there is an algorithm $\mathfrak{A}$ that takes as input a CMSO sentence $\varphi$, a positive integer…

The variant of the single-impurity Kondo problem in which the conduction-band density of states has a power-law pseudogap at the Fermi energy is known to exhibit a zero-temperature phase transition at a finite exchange coupling. The…

Fermi-edge absorption theory predicting the spectrum, A(\omega)\propto \omega^{-2\delta_0/\pi+\delta^2_0/\pi^2}, relies on the assumption that scattering phase, \delta_0, is frequency-independent. Dependence of \delta_0 on \omega becomes…

We present a new algorithm, Fractional Decomposition Tree (FDT) for finding a feasible solution for an integer program (IP) where all variables are binary. FDT runs in polynomial time and is guaranteed to find a feasible integer solution…

In many integer factoring algorithms, one produces a sequence of integers (created in a pseudo-random way), and wishes to rapidly determine a subsequence whose product is a square (which we call a square product). In his lecture at the 1994…

We study distributed algorithms for some fundamental problems in data summarization. Given a communication graph $G$ of $n$ nodes each of which may hold a value initially, we focus on computing $\sum_{i=1}^N g(f_i)$, where $f_i$ is the…

Let $P$ be a positive rational number. Call a function $f:\mathbb{R}\rightarrow\mathbb{R}$ to have $\textit{finite gaps property mod}$ $P$ if the following holds: for any positive irrational $\alpha$ and positive integer $M$, when the…

A finite non-increasing sequence of positive integers $d = (d_1\geq \cdots\geq d_n)$ is called a degree sequence if there is a graph $G = (V,E)$ with $V = \{v_1,\ldots,v_n\}$ and $deg(v_i)=d_i$ for $i=1,\ldots,n$. In that case we say that…

Let $\Gamma(G)$ be the Gruenberg-Kegel graph of a finite group $G$. We prove that if $G$ is solvable and $\sigma$ is a cut-set for $\Gamma(G)$, then $G$ has a $\sigma$-series of length $5$ whose factors are controlled. As a consequence, we…

Let $G$ be a finite simple non-complete connected graph on $[n] = \{1, \ldots, n\}$ and $\kappa(G) \geq 1$ its vertex connectivity. Let $f(G)$ denote the number of free vertices of $G$ and $\mathrm{diam}(G)$ the diameter of $G$. The final…

In this survey, my aim has been to discuss the use of sequences and countable sets in general topology. In this way I have been led to consider five different classes of topological spaces: first countable spaces, sequential spaces, Frechet…

Self-similar sets require a separation condition to admit a nice mathematical structure. The classical open set condition (OSC) is difficult to verify. Zerner proved that there is a positive and finite Hausdorff measure for a weaker…

We exhibit a polynomial time computable plane curve GAMMA that has finite length, does not intersect itself, and is smooth except at one endpoint, but has the following property. For every computable parametrization f of GAMMA and every…