Related papers: Finding cores of random 2-SAT formulae via Poisson…
Let $f_1=1,f_2=2$ and $f_i=f_{i-1}+f_{i-2}$ for $i>2$ be the sequence of Fibonacci numbers. Let $\Phi_h(n)$ be the quantity of partitions of natural number $n$ into $h$ different Fibonacci numbers. In terms of Zeckendorf partition of $n$ I…
For graphs $G$ and $F$, the saturation number $\textit{sat}(G,F)$ is the minimum number of edges in an inclusion-maximal $F$-free subgraph of $G$. In 2017, Kor\'andi and Sudakov initiated the study of saturation in random graphs. They…
We consider random systems of equations x_1 + ... + x_k = a; 0 <= a <= 2 which are interpreted as equations modulo 3: We show for k >= 15 that the satisfiability threshold of such systems occurs where the 2-core has density 1: We show a…
In this paper we discuss the existence, uniqueness and regularity of solutions of the following system of coupled semilinear Poisson equations on a smooth bounded domain $\Omega$ in $\mathbb{R}^n$: \[ \left\{{llll} \mathcal{A}^s u= v^p &…
This paper explores a fine-grained version of the Watrous conjecture, including the randomized and quantum algorithms with success probabilities arbitrarily close to $1/2$. Our contributions include the following: i) An analysis of the…
We introduce a highly structured family of hard satisfiable 3-SAT formulas corresponding to an ordered spin-glass model from statistical physics. This model has provably "glassy" behavior; that is, it has many local optima with large energy…
We show that if pn >> log n, the binomial random graph G_{n,p} has an approximate Hamilton decomposition. More precisely, we show that in this range G_{n,p} contains a set of edge-disjoint Hamilton cycles covering almost all of its edges.…
In this paper we extend a classical theorem of Corr\'adi and Hajnal into the setting of sparse random graphs. We show that if $p(n) \gg (\log n / n)^{1/2}$, then asymptotically almost surely every subgraph of $G(n,p)$ with minimum degree at…
We extend the theory of low-rank matrix recovery and completion to the case when Poisson observations for a linear combination or a subset of the entries of a matrix are available, which arises in various applications with count data. We…
This paper investigates simple $3$-$(2^n+1,13,\lambda)$ designs admitting $\mathrm{PSL}$$(2,2^n)$ as an automorphism group. We determine all possible values of $\lambda$ by systematically analyzing the orbits of $13$-element subsets under…
Self-consistent multi-particle simulation plays an important role in studying beam-beam effects and space charge effects in high-intensity beams. The Poisson equation has to be solved at each time-step based on the particle density…
A new approach for decoding binary linear codes by solving a linear program (LP) over a relaxed codeword polytope was recently proposed by Feldman et al. In this paper we investigate the structure of the polytope used in the LP relaxation…
We study a holomorphic Poisson structure defined on the linear space $S(n,d):= {\rm Mat}_{n\times d}(\mathbb{C}) \times {\rm Mat}_{d\times n}(\mathbb{C})$ that is covariant under the natural left actions of the standard ${\rm…
Particle physics experiments such as those run in the Large Hadron Collider result in huge quantities of data, which are boiled down to a few numbers from which it is hoped that a signal will be detected. We discuss a simple probability…
Spin-polarizabilities are predicted by calculating the cross-section difference $\sigma_{3/2}-\sigma_{1/2}$ from available data for the resonance couplings $A_{3/2}$ and $A_{1/2}$ and CGLN amplitudes. The forward spin-polarizabilities are…
Floorplanning is the first stage of VLSI physical design. An effective floorplanning engine definitely has positive impact on chip design speed, quality and performance. In this paper, we present a novel mathematical model to characterize…
We investigate the complexity of the Boolean clone membership problem (CMP): given a set of Boolean functions $F$ and a Boolean function $f$, determine if $f$ is in the clone generated by $F$, i.e., if it can be expressed by a circuit with…
A Fixed-Parameter Tractable (\FPT) $\rho$-approximation algorithm for a minimization (resp. maximization) parameterized problem $P$ is an FPT algorithm that, given an instance $(x, k)\in P$ computes a solution of cost at most $k \cdot…
Instances of logical cryptanalysis, circuit verification, and bounded model checking can often be succinctly represented as a combined satisfiability (SAT) problem where an instance is a combination of traditional clauses and parity…
We discuss a new algorithmic type of problem in random graphs studying the minimum number of queries one has to ask about adjacency between pairs of vertices of a random graph $G\sim {\mathcal G}(n,p)$ in order to find a subgraph which…