Related papers: An elementary proof of the halting property for Ch…
In this paper we revisit Talagrand's proof of concentration inequality for empirical processes. We give a different shorter proof of the main technical lemma that guarantees the existence of a certain kernel. Our proof provides the almost…
This is a commentary on, and critique of, Latif Salum's paper titled "Tractability of One-in-three $\mathrm{3SAT}$: $\mathrm{P} = \mathrm{NP}$." Salum purports to give a polynomial-time algorithm that solves the $\mathrm{NP}$-complete…
Probabilistic Hoare logic (PHL) is an extension of Hoare logic and is specifically useful in verifying randomized programs. It allows researchers to formally reason about the behavior of programs with stochastic elements, ensuring the…
We recently proposed Acceleration Driven Clause Learning (ADCL), a novel calculus to analyze satisfiability of Constrained Horn Clauses (CHCs). Here, we adapt ADCL to disprove termination of transition systems, and we evaluate its…
The wild part of Abhyankar's Inertia Conjecture for a product of certain Alternating groups is shown for any algebraically closed field of odd characteristic. For $d$ a multiple of the characteristic of the base field, a new \'etale…
Recently Schrijver's open problem, whether the Chv\'atal--Gomory closure of an irrational polytope is polyhedral was answered independently in the affirmative by Dadush, Dey, and Vielma (even for arbitrarily compact convex set) as well as…
The demonstration that the electromagnetic fields derived from the Lienard-Wiechert potentials do not satisfy the Maxwell equations is proved to be false. Errors were made in the computation of the derivatives of retarded quantities. The…
Classical models of computation traditionally resort to halting schemes in order to enquire about the state of a computation. In such schemes, a computational process is responsible for signalling an end of a calculation by setting a halt…
Parikh's theorem is a fundamental result of the formal language's theory. There had been published many proofs and many papers claimed to provide a simplified proof, but most of them are long and still complicated. We provide the proof that…
In 1982-83, E. Nochka proved a conjecture of Cartan on defects of holomorphic curves in $\Bbb P^n$ relative to a possibly degenerate set of hyperplanes. This was further explained by W. Chen in his 1987 thesis, and subseqently simplified by…
Avila's Almost Reducibility Conjecture (ARC) is a powerful statement linking purely analytic and dynamical properties of analytic one frequency $SL(2,\mathbb{C})$ cocycles. It is also a fundamental tool in the study of spectral theory of…
The ARRIVAL problem is to decide the fate of a train moving along the edges of a directed graph, according to a simple (deterministic) pseudorandom walk. The problem is in $NP \cap coNP$ but not known to be in $P$. The currently best…
We introduce some classical complexity-theoretic techniques to Parameterized Complexity. First, we study relativization for the machine models that were used by Chen, Flum, and Grohe (2005) to characterize a number of parameterized…
Blind and Mani (1987) proved that the entire combinatorial structure (the vertex-facet incidences) of a simple convex polytope is determined by its abstract graph. Their proof is not constructive. Kalai (1988) found a short, elegant, and…
This paper considers the question of P = NP in context of the polynomial time SAT algorithm. It posits proposition dependent on existence of conjectured problem that even where the algorithm is shown to solve SAT in polynomial time it…
The problem of stabilization of unstable periodic orbits of discrete nonlinear systems is considered in the article. A new generalization of the delayed feedback, which solves the stabilization problem, is proposed. The feedback is…
The advantages of tabled evaluation regarding program termination and reduction of complexity are well known --as are the significant implementation, portability, and maintenance efforts that some proposals (especially those based on…
The classical non-greedy algorithm (NGA) and the recently proposed proximal alternating minimization method with extrapolation (PAMe) for $L_1$-norm PCA are revisited and their finite-step convergence are studied. It is first shown that NGA…
The Exact Matching problem asks whether a bipartite graph with edges colored red and blue admits a perfect matching with exactly $t$ red edges. Introduced by Papadimitriou and Yannakakis in 1982, the problem has resisted deterministic…
The celebrated Erd\H{o}s-Hajnal conjecture states that for every proper hereditary graph class $\mathcal{G}$ there exists a constant $\varepsilon = \varepsilon(\mathcal{G}) > 0$ such that every graph $G \in \mathcal{G}$ contains a clique or…