English
Related papers

Related papers: Probabilistic formulation of the Hadwiger--Nelson …

200 papers

One discovers why the solution of generalized umbral calculus difference nonhomogeneous equation in the form recently proposed by the author extends here now to generalized appellian delta operator and corresponding polynomials case almost…

Combinatorics · Mathematics 2008-02-11 A. K. Kwasniewski

New versions and extensions of Benson's outer approximation algorithm for solving linear vector optimization problems are presented. Primal and dual variants are provided in which only one scalar linear program has to be solved in each…

Optimization and Control · Mathematics 2014-10-13 Andreas H. Hamel , Andreas Löhne , Birgit Rudloff

Cigler simple derivation of usual and extended Dobinski formula is recalled and it is noted that both may be interpreted as averages of powers of random variables with the corresponding usual or extended Poisson distributions. In parallel…

Combinatorics · Mathematics 2008-02-11 A. K. Kwasniewski

We revisit the traveling salesman problem with neighborhoods (TSPN) and propose several new approximation algorithms. These constitute either first approximations (for hyperplanes, lines, and balls in $\mathbb{R}^d$, for $d\geq 3$) or…

Computational Geometry · Computer Science 2015-11-26 Adrian Dumitrescu , Csaba D. Tóth

We introduce a novel algorithm for solving learning problems where both the loss function and the regularizer are non-convex but belong to the class of difference of convex (DC) functions. Our contribution is a new general purpose proximal…

Machine Learning · Computer Science 2015-07-03 Alain Rakotomamonjy , Remi Flamary , Gilles Gasso

We study the obstacle problem associated with the Kolmogorov operator $\Delta_v - \partial_t - v\cdot\nabla_x$, which arises from the theory of optimal control in Asian-American options pricing models. Our first main contribution is to…

Analysis of PDEs · Mathematics 2025-02-04 David Bowman

This paper introduces an alternative form of the derivation of Spivey's Bell number formula which involves the $q$-Boson operators $a$ and $a^{\dagger}$. Furthermore, a similar formula for the case of the $(q,r)$-Dowling polynomials is…

Number Theory · Mathematics 2017-12-22 Mahid M. Mangontarum

The optimistic gradient method is useful in addressing minimax optimization problems. Motivated by the observation that the conventional stochastic version suffers from the need for a large batch size on the order of…

Machine Learning · Computer Science 2024-01-29 Haoyuan Cai , Sulaiman A. Alghunaim , Ali H. Sayed

In this short note, we solve a Dirichlet problem for a fully nonlinear elliptic equation. The operator is introduced by S. Donaldson and it is relevant to the geometry of the space of volume forms.

Analysis of PDEs · Mathematics 2008-10-23 Weiyong He

This paper presents a novel and straight formulation, and gives a complete insight towards the understanding of the complexity of the problems of the so called NP-Class. In particular, this paper focuses in the Searching of the Optimal…

Computational Complexity · Computer Science 2010-06-14 Carlos Barron-Romero

In this work we consider data-driven optimization problems where one must maximize a function given only queries at a fixed set of points. This problem setting emerges in many domains where function evaluation is a complex and expensive…

Machine Learning · Computer Science 2021-02-17 Justin Fu , Sergey Levine

We establish asymptotic formulae for various correlations involving general divisor functions $d_k(n)$ and partial divisor functions $d_l(n,A)=\sum_{q|n:q\leq n^A}d_{l-1}(q)$, where $A\in[0,1]$ is a parameter and $k,l\in\mathbb{N}$ are…

Number Theory · Mathematics 2022-11-23 Kevin Smith , Julio Andrade

We consider the problems of finding the lexicographically minimal (or maximal) satisfying assignment of propositional formulae for different restricted formula classes. It turns out that for each class from our framework, the above problem…

Computational Complexity · Computer Science 2007-05-23 Steffen Reith , Heribert Vollmer

This paper considers the permissive supervisor synthesis for probabilistic systems modeled as Markov Decision Processes (MDP). Such systems are prevalent in power grids, transportation networks, communication networks and robotics. Unlike…

Logic in Computer Science · Computer Science 2017-03-23 Bo Wu , Xiaobin Zhang , Hai Lin

We consider a bilevel optimization problem in which the ground set is partitioned between two decision makers, a leader and a follower, whose optimization problems are interleaved. We study the Bilevel Independent Set problem, and its…

Data Structures and Algorithms · Computer Science 2026-05-26 Komal Muluk

Let $G$ be a group and $H_1$,...,$H_s$ be subgroups of $G$ of indices $d_1$,...,$d_s$ respectively. In 1974, M. Herzog and J. Sch\"onheim conjectured that if $\{H_i\alpha_i\}_{i=1}^{i=s}$, $\alpha_i\in G$, is a coset partition of $G$, then…

Group Theory · Mathematics 2024-11-20 Fabienne Chouraqui

In this article we propose a new concept of a $(\delta,L)$-model of a function which generalizes the concept of the $(\delta,L)$-oracle (Devolder-Glineur-Nesterov). Using this concept we describe the gradient descent method and the fast…

Optimization and Control · Mathematics 2019-06-26 Alexander Tyurin , Alexander Gasnikov

We use a new $q$-exponential operator based on the $q^{\pm1}$-derivative $\D_{q^{\pm1}}$ of order 1 to derive summation formulas for bilateral basic hypergeometric series ${}_{0}\psi_{1}$, ${}_{1}\psi_{1}$, ${}_{1}\psi_{2}$, and…

Combinatorics · Mathematics 2025-12-04 Ronald Orozco López

We study the problem of sampling from a distribution $\mu$ with density $\propto e^{-V}$ for some potential function $V:\mathbb R^d\to \mathbb R$ with query access to $V$ and $\nabla V$. We start with the following standard assumptions: (1)…

Data Structures and Algorithms · Computer Science 2026-02-10 Yuchen He , Zhehan Lei , Jianan Shao , Chihao Zhang

In this note we give a simplified ordinal analysis of first-order reflection. An ordinal notation system $OT$ is introduced based on $\psi$-functions. Provable $\Sigma_{1}$-sentences on $L_{\omega_{1}^{CK}}$ are bounded through…

Logic · Mathematics 2021-07-01 Toshiyasu Arai