English
Related papers

Related papers: An Improved Composition Theorem of a Universal Rel…

200 papers

We generalize the classical notion of adjoint of a linear operator and the Aron-Schottenloher notion of adjoint of a homogeneous polynomial. The general notion is shown to enjoy several properties enjoyed by the classical ones, nevertheless…

Functional Analysis · Mathematics 2018-11-01 Geraldo Botelho , Leodan A. Torres

This work studies constrained stochastic optimization problems where the objective and constraint functions are convex and expressed as compositions of stochastic functions. The problem arises in the context of fair classification, fair…

Machine Learning · Computer Science 2022-09-13 Srujan Teja Thomdapu , Harshvardhan , Ketan Rajawat

In 1974 Kolmogorov proposed a non-probabilistic approach to statistics and model selection. Let data be finite binary strings and models be finite sets of binary strings. Consider model classes consisting of models of given maximal…

Computational Complexity · Computer Science 2007-05-23 Nikolai Vereshchagin , Paul Vitanyi

Given an arithmetic function $g(n)$ write $M_g(x) := \sum_{n \leq x} g(n)$. We extend and strengthen the results of a fundamental paper of Hal\'{a}sz in several ways by proving upper bounds for the ratio of $\frac{|M_g(x)|}{M_{|g|}(x)}$,…

Number Theory · Mathematics 2016-04-19 Alexander P. Mangerel

We prove two main results on Denjoy-Carleman classes: (1) a composite function theorem which asserts that a function f(x) in a quasianalytic Denjoy-Carleman class Q, which is formally composite with a generically submersive mapping y=h(x)…

Complex Variables · Mathematics 2019-02-20 André Belotto da Silva , Edward Bierstone , Michael Chow

Let $m(G)$ be the infimum of the volumes of all open subgroups of a unimodular locally compact group $G$. Suppose integrable functions $\phi_1 , \phi_2 \colon G \to [0,1]$ satisfy $\| \phi_1 \| \leq \| \phi_2 \|$ and $\| \phi_1 \| + \|…

Metric Geometry · Mathematics 2023-02-21 Takashi Satomi

We study a poset of compositions restricted by part size under a partial ordering introduced by Bj\"{o}rner and Stanley. We show that our composition poset $C_{d+1}$ is isomorphic to the poset of words $A_d^*$. This allows us to use…

Combinatorics · Mathematics 2012-04-23 Adam M. Goyt

Composition operators with analytic symbols on some reproducing kernel Hilbert spaces of entire functions on a complex Hilbert space are studied. The questions of their boundedness, seminormality and positivity are investigated. It is…

Functional Analysis · Mathematics 2016-10-17 Jan Stochel , Jerzy B. Stochel

An algebraic approximation, of order $K$, of a polyhedron correlation function (CF) can be obtained from $\gamma\pp(r)$, its chord-length distribution (CLD), considering first, within the subinterval $[D_{i-1},\, D_i]$ of the full range of…

General Mathematics · Mathematics 2020-12-03 Salvino Ciccariello

Two of the pillars of combinatorics are the notion of choosing an arbitrary subset of a set with $n$ elements (which can be done in $2^n$ ways), and the notion of choosing a $k$-element subset of a set with $n$ elements (which can be done…

Combinatorics · Mathematics 2007-05-23 James Propp

Our aim is to study the Ulam's problem for Cauchy's functional equations. First, we present some new results about the superstability and stability of Cauchy exponential functional equation and its Pexiderized for class functions on…

Classical Analysis and ODEs · Mathematics 2014-06-10 Ali Sadeghi

All known proofs of the PCP theorem rely on multiple "composition" steps, where PCPs over large alphabets are turned into PCPs over much smaller alphabets at a (relatively) small price in the soundness error of the PCP. Algebraic proofs,…

Computational Complexity · Computer Science 2026-03-25 Prashanth Amireddy , Amik Raj Behera , Srikanth Srinivasan , Madhu Sudan , Sophus Valentin Willumsgaard

Replicability requires that algorithmic conclusions remain consistent when rerun on independently drawn data. A central structural question is composition: given $k$ problems each admitting a $\rho$-replicable algorithm with sample…

Higher-order unification has been shown to be undecidable. Miller discovered the pattern fragment and subsequently showed that higher-order pattern unification is decidable and has most general unifiers. We extend the algorithm to…

Logic in Computer Science · Computer Science 2025-04-18 Zhibo Chen , Frank Pfenning

A strong direct product theorem states that if we want to compute $k$ independent instances of a function, using less than $k$ times the resources needed for one instance, then the overall success probability will be exponentially small in…

Computational Complexity · Computer Science 2010-04-12 Hartmut Klauck

Most music theory books are like medieval medical textbooks: they contain unjustified superstition, non-reasoning, and funny symbols glorified by Latin phrases. How does music, in particular harmony, actually work, presented as a real,…

Sound · Computer Science 2014-06-13 Daniel Shawcross Wilkerson

The Weak Gravity Conjecture has recently been re-formulated in terms of a particle with non-negative self-binding energy. Because of the dual conformal field theory (CFT) formulation in the anti-de Sitter space the conformal dimension…

High Energy Physics - Theory · Physics 2022-01-19 Oleg Antipin , Jahmall Bersini , Francesco Sannino , Zhi-Wei Wang , Chen Zhang

In this paper we define a function $L$ which will allow us to (separately or simultaneously) generalize many theorems from Number Theory obtained by Wilson, Fermat, Euler, Gauss, Lagrange, Leibniz, Moser, and Sierpinski.

General Mathematics · Mathematics 2007-05-23 Florentin Smarandache

We prove a form of the $\cos \pi \rho$ theorem which gives strong estimates for the minimum modulus of a transcendental entire function of order zero. We also prove a generalisation of a result of Hinkkanen that gives a sufficient condition…

Complex Variables · Mathematics 2008-01-24 P. J. Rippon , G. M. Stallard

A notion of generalized $n$-semimodularity is introduced, which extends that of (sub/super)mod\-ularity in four ways at once. The main result of this paper, stating that every generalized $(n\colon\!2)$-semimodular function on the $n$th…

Probability · Mathematics 2019-02-15 Iosif Pinelis