English
Related papers

Related papers: Sparse analytic systems

200 papers

If $R$ is a real analytic set in $\C^n$ (viewed as $\R^{2n}$), then for any point $p\in R$ there is a uniquely defined germ $X_p$ of the smallest complex analytic variety which contains $R_p$, the germ of $R$ at $p$. It is shown that if $R$…

Complex Variables · Mathematics 2007-05-23 Rasul Shafikov

Within the gossamer numbers which extend the real numbers to include infinitesimals and infinities we prove the Fundamental Theorem of Calculus (FTC). Riemann sums are also considered in the gossamer number system, and their non-uniqueness…

General Mathematics · Mathematics 2015-02-25 Chelton D. Evans , William K. Pattinson

The sparse analogue of Szemer\'edi's regularity method has played a central role in the development of extremal results for random graphs. While the sparse embedding lemma (the KLR conjecture) has been resolved, the corresponding sparse…

Combinatorics · Mathematics 2026-04-01 Warach Veeranonchai

In this paper, we introduce and investigate the concepts of down continuity and down compactness. A real valued function $f$ on a subset $E$ of $\R$, the set of real numbers is down continuous if it preserves downward half Cauchy sequences,…

Functional Analysis · Mathematics 2018-02-06 Huseyin Cakalli

Monadic stability generalizes many tameness notions from structural graph theory such as planarity, bounded degree, bounded tree-width, and nowhere density. The sparsification conjecture predicts that the (possibly dense) monadically stable…

Discrete Mathematics · Computer Science 2026-01-23 Nikolas Mählmann , Sebastian Siebertz

Let (X, d) be a quasi-convex, complete and separable metric space with reference probability measure m. We prove that the set of of real valued Lipschitz function with non zero point-wise Lipschitz constant m-almost everywhere is residual,…

Analysis of PDEs · Mathematics 2013-06-21 Fabio Cavalletti

Assuming the Continuum Hypothesis, there is a compact first countable connected space of weight aleph_1 with no totally disconnected perfect subsets. Each such space, however, may be destroyed by some proper forcing order which does not add…

General Topology · Mathematics 2007-05-23 Joan E. Hart , Kenneth Kunen

We introduce a family of maps generating continued fractions where the digit $1$ in the numerator is replaced cyclically by some given non-negative integers $(N_1,\ldots,N_m)$. We prove the convergence of the given algorithm, and study the…

Dynamical Systems · Mathematics 2021-12-09 Karma Dajani , Niels Langeveld

In this paper, we study the exceptional sets $S_f$ of $p$-adic transcendental analytic functions $f$ with rational and algebraic coefficients. We establish a necessary condition for a subset $S \subseteq \overline{\mathbb{Q}} \cap B(0,…

Number Theory · Mathematics 2024-07-19 Bruno De Paula Miranda , Jean Lelis

HMC sets are hereditarily at most countable sets. We rework a substantial part of univariate real analysis in a form in which only HMC real functions are used. In such countable real analysis we carry out Hilbert's proof of transcendence of…

Logic · Mathematics 2025-02-11 Martin Klazar

Since the theory developed by Georg Cantor, mathematicians have taken a sharp interest in the sizes of infinite sets. We know that the set of integers is infinitely countable and that its cardinality is Aleph0. Cantor proved in 1891 with…

General Mathematics · Mathematics 2008-09-25 Laurent Germain

We prove that if $X$ is a paracompact space, $Y$ is a metric space and $f:X\to Y$ is a functionally fragmented map, then (i) $f$ is $\sigma$-discrete and functionally $F_\sigma$-measurable; (ii) $f$ is a Baire-one function, if $Y$ is weak…

General Topology · Mathematics 2019-01-23 Olena Karlova

It is known that first-order logic with some counting extensions can be efficiently evaluated on graph classes with bounded expansion, where depth-$r$ minors have constant density. More precisely, the formulas are $\exists x_1 ... x_k \#y…

Logic in Computer Science · Computer Science 2023-07-06 Jan Dreier , Daniel Mock , Peter Rossmanith

In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…

Combinatorics · Mathematics 2009-02-10 László Lovász , Balázs Szegedy

Efroymson's approximation theorem asserts that if $f$ is a $\mathcal{C}^0$ semialgebraic mapping on a $\mathcal{C}^\infty$ semialgebraic submanifold $M$ of $\mathbb{R}^n$ and if $\varepsilon:M\to \mathbb{R}$ is a positive continuous…

Algebraic Geometry · Mathematics 2019-05-15 Anna Valette , Guillaume Valette

We prove that, e.g., if mu >cf(mu)= aleph_0 and mu>2^{aleph_0} and every stationary family of countable subsets of mu^+ reflect in some subset of mu^+ of cardinality aleph_1, then the SCH for mu^+ (moreover, for mu^+, any scale for mu^+ has…

Logic · Mathematics 2007-09-30 Saharon Shelah

Regular functions from infinite words to infinite words can be equivalently specified by MSO-transducers, streaming $\omega$-string transducers as well as deterministic two-way transducers with look-ahead. In their one-way restriction, the…

Formal Languages and Automata Theory · Computer Science 2024-09-19 V. Dave , E. Filiot , S. Krishna , N. Lhote

We prove a.s. (almost sure) unisolvency of interpolation by continuous random sampling with respect to any given density, in spaces of multivariate a.e. (almost everywhere) analytic functions. Examples are given concerning polynomial and…

Numerical Analysis · Mathematics 2023-03-27 Francesco Dell'Accio , Alvise Sommariva , Marco Vianello

We investigate the nonparametric, composite hypothesis testing problem for arbitrary unknown distributions in the asymptotic regime where both the sample size and the number of hypotheses grow exponentially large. Such asymptotic analysis…

Information Theory · Computer Science 2019-01-30 Qunwei Li , Tiexing Wang , Donald J. Bucci , Yingbin Liang , Biao Chen , Pramod K. Varshney

A function $f : \mathbb{F}_2^n \to \mathbb{R}$ is $s$-sparse if it has at most $s$ non-zero Fourier coefficients. Motivated by applications to fast sparse Fourier transforms over $\mathbb{F}_2^n$, we study efficient algorithms for the…

Data Structures and Algorithms · Computer Science 2019-10-15 Grigory Yaroslavtsev , Samson Zhou