Related papers: Analytic p-adic Cell Decomposition and Integrals
The theory of modular deformations is generalized for the category of complex analytic polyhedra which includes germs of complex space as well as any compact complex analytic space. The objective of the theory is a construction of fine…
A function on a topological space is called unimodal if all of its super-level sets are contractible. A minimal unimodal decomposition of a function $f$ is the smallest number of unimodal functions that sum up to $f$. The problem of…
Expanding upon recent work, a new class of $A$-functions is introduced that can be viewed as an appropriate generalization of the class of regular $A$-functions, the class of structured $A$-functions, and the class of perfect $A$-functions.…
We discuss the deep relationship between $\infty$-categorical functional analysis and the anticipated theory of $p$-adic motives. The motivation fundamentally comes from applications essentially in arithmetics from very broad perspectives.…
We investigate the distribution of cells by dimension in cylindrical algebraic decompositions (CADs). We find that they follow a standard distribution which seems largely independent of the underlying problem or CAD algorithm used. Rather,…
We propose a simple approach to formal deformations of associative algebras. It exploits the machinery of multiplicative coresolutions of an associative algebra A in the category of A-bimodules. Specifically, we show that certain…
In the framework of the generalized measure theory the decomposable probabilistic-valued set functions are introduced with triangle functions $\tau$ in an appropriate probabilistic metric space as natural candidates for the "addition",…
Given a real analytic set X in a complex manifold and a positive integer d, denote by A(d) the set of points p in X at which there exists a germ of a complex analytic set of dimension d contained in X. It is proved that A(d) is a closed…
We describe an algorithm to decompose rational functions from which we determine the poset of groups fixing these functions.
An analytical approach to convolution of functions, which appear in perturbative calculations, is discussed. An extended list of integrals is presented.
Intuitionistic belief has been axiomatized by Artemov and Protopopescu as an extension of intuitionistic propositional logic by means of the distributivity scheme K, and of co-reflection $A\rightarrow\Box A$. This way, belief is interpreted…
This work makes explicit the degrees of freedom involved in modeling the dynamics of a network, or some other first-order property of a network, such as a measurement function. In previous work, an admissible function in a network was…
Let $K$ be a field with a discrete valuation, and let $p$ and $\ell$ be (possibly equal) primes which are not necessarily different from the residue characteristic. Given a superelliptic curve $C : y^p = f(x)$ which has split degenerate…
We combine the language of monoids with the language of preorders so as to refine some fundamental aspects of the classical theory of factorization and prove an abstract factorization theorem with a variety of applications. In particular,…
Cylindrical Algebraic Decompositions (CADs) endowed with additional topological properties have found applications beyond their original logical setting, including algorithmic optimizations in CAD construction, robot motion planning, and…
Decomposition methods are often used for producing counterfactual predictions in non-strategic settings. When the outcome of interest arises from a game-theoretic setting where agents are better off by deviating from their strategies after…
Functional ANOVA offers a principled framework for interpretability by decomposing a model's prediction into main effects and higher-order interactions. For independent features, this decomposition is well-defined, strongly linked with SHAP…
We combine several folklore observations to provide a working framework for iterating constructions which contradict the axiom of choice. We use this to define a model in which any kind of structural failure must fail with a proper class of…
Extending the idea of Even and Lehrer [3], we discuss a general approach to integration based on a given decomposition system equipped with a weighting function, and a decomposition of the integrated function. We distinguish two type of…
Algorithmicists are well-aware that fast dynamic programming algorithms are very often the correct choice when computing on compositional (or even recursive) graphs. Here we initiate the study of how to generalize this folklore intuition to…