20 results for “Complex analysis”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
The paper shows that for composite square free n, there exist two vectors with disjoint supports in both time and frequency domains, contradicting a reduction in Haagerup's proof for prime n that fini…
The paper proves that a specific condition guarantees a non-injective phase retrieval map.
This paper introduces a local-to-global method for analyzing low influence functions on simplicial complexes and proves a local-to-global KKL-type Theorem.
The authors construct r-dimensional cubical sheaf complexes with positive constant rate, linear distance, and constant soundness for CSS codes.
This paper analyzes the convergence of the RLS algorithm using the Cauchy Interlace Theorem and presents an improved initialization method.
This paper develops a constructive version of Green's Arithmetic Regularity Lemma for finite Abelian groups of constant torsion.
This paper investigates the closeness of singularity for $n imes n$ unimodular matrices, specifically for $(2k+1)$-ary and $(k+1)$-ary cases of $4 imes 4$ nonnegative unimodular matrices.
This paper simplifies the proof of the bound on the target dimension for reducing the dimension of high-dimensional polygonal curves using random projections, extending it to various distance measures…
The paper places the existential theory of the reals in the counting hierarchy and provides bounds for various problems.
The paper proves the real-rootedness and ultra-log-concavity of the Poincaré polynomials for the moduli space $\overline{\mathcal M}_{0,n}$ and the Fulton--MacPherson space $\mathbb{P}^1[n]$ using a n…
This paper studies the metric entropy and uniform sampling of signals with prescribed Fourier ratio.
This paper identifies a technical oversight in Mossel and Peres (2005) theorem on designing Bernoulli factories for multivariable functions and provides a counterexample.
The paper studies the polar method for determinantal-complexity lower bounds and provides quantitative results on the intersection-theoretic complexity of kernel-incidence constructions and the size o…