English
Related papers

Related papers: Subgaussian sequences in probability and Fourier a…

200 papers

We study properties of the Weyl pseudometric associated with an action of a countable amenable group on a compact metric space. We prove that the topological entropy and the number of minimal subsets of the closure of an orbit are both…

Dynamical Systems · Mathematics 2018-08-01 Martha Łącka , Marta Straszak

We introduce a category of dual pairs of finite locally free algebras over a ring. This gives an efficient way to represent finite locally free commutative group schemes. We give a number of algorithms to compute with dual pairs of…

Number Theory · Mathematics 2017-09-29 Peter Bruin

We derive a new closed-form variance-adaptive confidence sequence (CS) for estimating the average conditional mean of a sequence of bounded random variables. Empirically, it yields the tightest closed-form CS we have found for tracking…

Statistics Theory · Mathematics 2025-12-25 Ben Chugg , Aaditya Ramdas

In this paper, we relate the framework of mod-$\phi$ convergence to the construction of approximation schemes for lattice-distributed random variables. The point of view taken here is that of Fourier analysis in the Wiener algebra, allowing…

Probability · Mathematics 2020-07-06 Reda Chhaibi , Freddy Delbaen , Pierre-Loïc Méliot , Ashkan Nikeghbali

The main result is a Paley's theory for lacunary Fourier series using semigroup-BMO and $H^1$ spaces. This interpretation allows an extension of Paley's theory to general discrete groups, complementing the work of Rudin for abelian groups…

Functional Analysis · Mathematics 2019-09-17 Tao Mei

Ergodic theory, Higher order Fourier analysis and the hyper graph regularity method are three possible approaches to Szemer\'edi type theorems in abelian groups. In this paper we develop an algebraic theory that creates a connection between…

Combinatorics · Mathematics 2009-03-06 Balazs Szegedy

In the ElGamal signature and encryption schemes, an element $x$ of the underlying group $G = \mathbb{Z}_p^\times = \{1, \ldots, p-1 \}$ for a prime $p$ is also considered as an exponent, for example in $g^x$, where $g$ is a generator of G.…

We propose an open loop methodology based on sample statistics to solve chance constrained stochastic optimal control problems with probabilistic safety guarantees for linear systems where the additive Gaussian noise has unknown mean and…

Systems and Control · Electrical Eng. & Systems 2023-03-24 Shawn Priore , Meeko Oishi

A connection between the Galois-theoretic approach to semi-abelian homology and the homological closure operators is established. In particular, a generalised Hopf formula for homology is obtained, allowing the choice of a new kind of…

Category Theory · Mathematics 2014-10-14 Mathieu Duckerts-Antoine , Tomas Everaert , Marino Gran

We investigate numerical semigroups generated by any quadratic sequence with initial term zero and an infinite number of terms. We find an efficient algorithm for calculating the Ap\'ery set, as well as bounds on the elements of the Ap\'ery…

Group Theory · Mathematics 2020-09-07 Mara Hashuga , Megan Herbine , Alathea Jensen

A product of two Gaussians (or normal distributions) is another Gaussian. That's a valuable and useful fact! Here we use it to derive a refactoring of a common product of multivariate Gaussians: The product of a Gaussian likelihood times a…

Computation · Statistics 2020-06-01 David W. Hogg , Adrian M. Price-Whelan , Boris Leistedt

We point out that a sequence of natural numbers is the dimension sequence of a subproduct system if and only if it is the cardinality sequence of a word system (or factorial language). Determining such sequences is, therefore, reduced to a…

Functional Analysis · Mathematics 2020-11-17 Malte Gerhold , Michael Skeide

This paper considers data-driven chance-constrained stochastic optimization problems in a Bayesian framework. Bayesian posteriors afford a principled mechanism to incorporate data and prior knowledge into stochastic optimization problems.…

Statistics Theory · Mathematics 2023-08-07 Prateek Jaiswal , Harsha Honnappa , Vinayak A. Rao

We study a binary Thue--Morse-type sequence arising from the base-$3/2$ expansion of integers, an archetypal automatic sequence in a rational base numeration system. Because the sequence is generated by a periodic iteration of morphisms…

Combinatorics · Mathematics 2026-02-26 Julien Cassaigne , Bastiàn Espinoza , Michel Rigo , Manon Stipulanti

We describe the main questions connected to torsion subgroups in the unit group of integral group rings of finite groups and algorithmic methods to attack these questions. We then prove the Zassenhaus Conjecture for Amitsur groups and prove…

Representation Theory · Mathematics 2020-04-09 Andreas Bächle , Wolfgang Kimmerle , Leo Margolis

We study small-scale and high-frequency turbulent fluctuations in three-dimensional flows under Fourier-mode reduction. The Navier-Stokes equations are evolved on a restricted set of modes, obtained as a projection on a fractal or…

Several machine learning problems arising in natural language processing can be modeled as a sequence labeling problem. We provide Gaussian process models based on pseudo-likelihood approximation to perform sequence labeling. Gaussian…

Machine Learning · Computer Science 2016-09-22 P. K. Srijith , P. Balamurugan , Shirish Shevade

A nonparametric Bayes approach is proposed for the problem of estimating a sparse sequence based on Gaussian random variables. We adopt the popular two-group prior with one component being a point mass at zero, and the other component being…

Methodology · Statistics 2017-05-31 Yunbo Ouyang , Feng Liang

In the context of mod-Gaussian convergence, as defined previously in our work with J. Jacod, we obtain lower bounds for local probabilities for a sequence of random vectors which are approximately Gaussian with increasing covariance. This…

Number Theory · Mathematics 2014-02-26 E. Kowalski , A. Nikeghbali

Let $f$ and $g$ be Boolean functions over a finite Abelian group $\mathcal{G}$, where $g$ is fully known, and we have {\em query access} to $f$, that is, given any $x \in \mathcal{G}$ we can get the value $f(x)$. We study the tolerant…

Computational Complexity · Computer Science 2025-07-11 Swarnalipa Datta , Arijit Ghosh , Chandrima Kayal , Manaswi Paraashar , Manmatha Roy