ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Complex analysis”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

math.CAcs.ITTheoreticalRecentAug 6, 2026

On number of cyclic $n$-roots and disjointness of Fourier supports

Weiqi Zhou

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…

View →
math.FAcs.ITmath.PRTheoreticalRecentJun 16, 2026

On Injectivity of Phase Retrieval

Zhangsong Li

The paper proves that a specific condition guarantees a non-injective phase retrieval map.

View →
math.COcs.CCcs.DMTheoreticalRecentJun 28, 2026

Toward a KKL Theorem for any HDX

Max Hopkins

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.

View →
cs.ITcs.CCquant-phTheoreticalRecentSep 23, 2026

Cubical Sheaf Complexes with Constant Expansion with Applications to Asymptotically Good qLTCs

Yeyuan Chen, Miryam Mi-Ying Huang, Yinchen Liu, Er-Cheng Tang

The authors construct r-dimensional cubical sheaf complexes with positive constant rate, linear distance, and constant soundness for CSS codes.

View →
eess.SPTheoreticalRecentSep 18, 2026

The Impact of the Cauchy Interlace Theorem on the Convergence of the RLS Algorithm

Hans Georg Brachtendorf

This paper analyzes the convergence of the RLS algorithm using the Cauchy Interlace Theorem and presents an improved initialization method.

View →
cs.DSTheoreticalRecentOct 19, 2026

Constructive Arithmetic Regularity for Abelian Groups

Swarnalipa Datta, Arijit Ghosh, Chandrima Kayal, Manmatha Roy

This paper develops a constructive version of Green's Arithmetic Regularity Lemma for finite Abelian groups of constant torsion.

View →
math.COcs.DMmath.NTTheoreticalRecentJul 8, 2026

Small Matrices with Large Inverses: Unimodular $4 \times 4$ Cases

Steven Finch

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.

View →
cs.DScs.CGcs.LGTheoreticalRecentJul 3, 2026

Dimension Reduction for Curves: Simplified and Generalized

Matthijs Ebbens, Jie Lu, Alexander Munteanu

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…

View →
cs.CCcs.CGTheoreticalRecentOct 7, 2026

$\exists \mathbb{R} \subseteq \textsf{CH}$

Alex Meiburg

The paper places the existential theory of the reals in the counting hierarchy and provides bounds for various problems.

View →
math.AGcs.AIcs.NERecentMay 27, 2026

Real-rootedness of the Poincaré polynomials of $\overline{\mathcal M}_{0,n}$: an AI-assisted proof

Gergely Bérczi, Young-Hoon Kiem

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…

View →
math.CAcs.ITTheoreticalRecentJun 23, 2026

Metric entropy of Fourier ratio classes on ${\mathbb Z}_N$

Alex Iosevich, Vahagn Hovhannisyan, Zahra Keyshams, Armen Vagharshakyan

This paper studies the metric entropy and uniform sampling of signals with prescribed Fourier ratio.

View →
math.PRcs.DMcs.FLTheoreticalRecentJun 28, 2026

Note on Finite-Automata Bernoulli Factories for Rational Functions

Renato Paes Leme, Jon Schneider

This paper identifies a technical oversight in Mossel and Peres (2005) theorem on designing Bernoulli factories for multivariable functions and provides a counterexample.

View →
cs.CCTheoreticalRecentJun 14, 2026

The Exact Reach of Conormal Invariants in Determinantal Complexity: a Quadratic No-Go Theorem

Karthik Sheshadri

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…

View →