English
Related papers

Related papers: Non-Additive Discrepancy: Coverage Functions in a …

200 papers

We analyze a finite-difference approximation of a functional of Ambrosio-Tortorelli type in brittle fracture, in the discrete-to-continuum limit. In a suitable regime between the competing scales, namely if the discretization step $\delta$…

Analysis of PDEs · Mathematics 2020-07-31 Vito Crismale , Giovanni Scilla , Francesco Solombrino

We introduce a correlation coefficient that is designed to deal with a variety of ranking formats including those containing non-strict (i.e., with-ties) and incomplete (i.e., unknown) preferences. The correlation coefficient is designed to…

Applications · Statistics 2019-02-19 Yeawon Yoo , Adolfo R. Escobedo , J. Kyle Skolfield

This paper generalizes for non-abelian theta functions a number of formulae valid for theta functions of Jacobian varieties. The addition formula, the relation with the Szego kernel and with the multicomponent KP hierarchy and the behavior…

Algebraic Geometry · Mathematics 2016-08-15 E. Gómez González , F. J. Plaza Martín

We consider set covering problems where the underlying set system satisfies a particular replacement property w.r.t. a given partial order on the elements: Whenever a set is in the set system then a set stemming from it via the replacement…

Discrete Mathematics · Computer Science 2015-03-17 Friedrich Eisenbrand , Naonori Kakimura , Thomas Rothvoß , Laura Sanità

Using analytic torsion associated to stable bundles, we introduce zeta functions for compact Riemann surfaces. To justify the well-definedness, we analyze the degenerations of analytic torsions at the boundaries of the moduli spaces, the…

Algebraic Geometry · Mathematics 2012-09-21 Lin Weng

We study graph parameters whose associated edge-connection matrices have exponentially bounded rank growth. Our main result is an explicit construction of a large class of graph parameters with this property that we call mixed partition…

Combinatorics · Mathematics 2020-06-16 Guus Regts , Bart Sevenster

A new notion of partition-determined functions is introduced, and several basic inequalities are developed for the entropy of such functions of independent random variables, as well as for cardinalities of compound sets obtained using these…

Information Theory · Computer Science 2012-06-05 Mokshay Madiman , Adam Marcus , Prasad Tetali

We prove a variant of the Mergelyan approximation theorem that allows us to approximate functions that are analytic and nonvanishing in the interior of a compact set K with connected complement, and whose interior is a Jordan domain, with…

Complex Variables · Mathematics 2013-01-11 Johan Andersson

We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…

Classical Analysis and ODEs · Mathematics 2023-05-31 Marcel de Jeu

Functional graphical models have undergone extensive development during the recent years, leading to a variety models such as the functional Gaussian graphical model, the functional copula Gaussian graphical model, the functional Bayesian…

Methodology · Statistics 2026-01-23 Kyongwon Kim , Bing Li

We introduce a deficiency-based representation and approximation framework for values of the Riemann zeta function. The method is based on comparing two nonlinear accumulation mechanisms: global transformation of a base partial sum and…

General Mathematics · Mathematics 2026-05-05 Meisam Mohammady

We prove a uniform boundary Harnack inequality for nonnegative harmonic functions of the fractional Laplacian on arbitrary open set $D$. This yields a unique representation of such functions as integrals against measures on $D^c\cup…

Probability · Mathematics 2017-02-15 Krzysztof Bogdan , Tadeusz Kulczycki , Mateusz Kwaśnicki

In this paper, we propose compactly supported radial basis functions for solving some well- known classes of astrophysics problems categorized as non-linear singular initial ordinary dif- ferential equations on a semi-infinite domain. To…

Numerical Analysis · Mathematics 2016-05-31 Kourosh Parand , Mohammad Hemami

This paper presents a noncommutative theory of symmetric functions, based on the notion of quasi-determinant. We begin with a formal theory, corresponding to the case of symmetric functions in an infinite number of independent variables.…

High Energy Physics - Theory · Physics 2008-02-03 Israel Gelfand , D. Krob , Alain Lascoux , B. Leclerc , V. S. Retakh , J. -Y. Thibon

The combinatorial discrepancy of arithmetic progressions inside $[N] := \{1, \ldots, N\}$ is the smallest integer $D$ for which $[N]$ can be colored with two colors so that any arithmetic progression in $[N]$ contains at most $D$ more…

Combinatorics · Mathematics 2026-01-27 Lily Li , Aleksandar Nikolov

This paper relates comparative belief structures and a general view of belief management in the setting of deductively closed logical representations of accepted beliefs. We show that the range of compatibility between the classical…

Artificial Intelligence · Computer Science 2013-02-01 Didier Dubois , Helene Fargier , Henri Prade

We obtain a criterion for an analytic subset of a Euclidean space to contain points of differentiability of a typical Lipschitz function, namely, that it cannot be covered by countably many sets, each of which is closed and purely…

Functional Analysis · Mathematics 2020-11-11 Michael Dymond , Olga Maleva

Building on B.Park and Vondrak's recent generalization of the J.Park-Pham Theorem (formerly known as Kahn-Kalai conjecture) to non-uniform probability measures, this paper introduces the notion of "spread" for the non-uniform setting. This…

Combinatorics · Mathematics 2026-03-17 Thinula De Silva , Pu Gao

We study the problem of approximating and learning coverage functions. A function $c: 2^{[n]} \rightarrow \mathbf{R}^{+}$ is a coverage function, if there exists a universe $U$ with non-negative weights $w(u)$ for each $u \in U$ and subsets…

Machine Learning · Computer Science 2014-05-29 Vitaly Feldman , Pravesh Kothari

We investigate the classical and distributed complexity of \emph{$k$-partial $c$-coloring} where $c=k$, a natural generalization of Brooks' theorem where each vertex should be colored from the palette $\{1,\ldots,c\} = \{1,\ldots,k\}$ such…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-08-27 Jan Bok , Avinandan Das , Anna Gujgiczer , Nikola Jedličková