English
Related papers

Related papers: Note on lower estimates of multiplicities

200 papers

A counter-example to lower bounds for the singular values of the sum of two matrices in [1] and [2] is given. Correct forms of the bounds are pointed out.

General Mathematics · Mathematics 2015-07-24 Sergey Loyka

In this paper we improve the lower bound of Chatterjee et al.\ (ECCC 2019) to an $\Omega(n^2)$ lower bound for unlayered Algebraic Branching Programs. We also study the impact layerization has on Algebraic Branching Programs. We exhibit a…

Computational Complexity · Computer Science 2020-09-18 Christian Engels

We obtain a lower bound on each entry of the principal eigenvector of a non-regular connected graph.

Combinatorics · Mathematics 2014-03-11 Felix Goldberg

This work is devoted to lower bounds on independence numbers of distance graphs with vertices in $\{-1,0,1\}^n$. The asymptotic case is studied, yielding new results over a broad range of parameters. Numerical results are presented,…

Combinatorics · Mathematics 2025-02-20 A. R. Akhiiarov , A. V. Bobu , A. M. Raigorodskii

We prove lower bounds on the error incurred when approximating any oscillating function using piecewise polynomial spaces. The estimates are explicit in the polynomial degree and have optimal dependence on the meshwidth and frequency when…

Numerical Analysis · Mathematics 2024-12-05 Jeffrey Galkowski

It is well known that $n/(n - \mu)$, where $\mu$ is the spectral radius of a graph with $n$ vertices, is a lower bound for the clique number. We conjecture that $\mu$ can be replaced in this bound with $\sqrt{s^+}$, where $s^+$ is the sum…

Combinatorics · Mathematics 2018-08-10 Clive Elphick , Pawel Wocjan

In this paper, we develop a computational approach for estimating the mean value of a quantity in the presence of uncertainty. We demonstrate that, under some mild assumptions, the upper and lower bounds of the mean value are efficiently…

Statistics Theory · Mathematics 2013-11-05 Xinjia Chen

One aspect of Poisson approximation is that the support of the random variable of interest is often finite while the support of the Poisson distribution is not. In this paper we will remedy this by examining truncated negative binomial (of…

Probability · Mathematics 2017-05-02 H. L. Gan

In this paper we present a new error bound on sampling algorithms for frequent itemsets mining. We show that the new bound is asymptotically tighter than the state-of-art bounds, i.e., given the chosen samples, for small enough error…

Data Structures and Algorithms · Computer Science 2017-03-27 Shiyu Ji , Kun Wan

In this paper we prove lower bounds for sizes of refutations of unsatisfiable vector Subset Sum instances $\overrightarrow{a}_1 x_1 + \dots + \overrightarrow{a}_n x_n = \overrightarrow{b}$ in the proof system Res(lin$_{\mathbb{F}_q}$) where…

Computational Complexity · Computer Science 2026-04-23 Fedor Part

This article examines lower bounds for the representation growth of finitely generated (particularly profinite and pro-p) groups. It also considers the related question of understanding the maximal multiplicities of character degrees in…

Group Theory · Mathematics 2009-10-06 David A Craven

We derive a Cram\'er-Rao lower bound for the variance of Floquet multiplier estimates that have been constructed from stable limit cycles perturbed by noise. To do so, we consider perturbed periodic orbits in the plane. We use a periodic…

Dynamical Systems · Mathematics 2017-11-30 Aurya Javeed

We use a coin flipping model for the random partition and Chebyshev's inequality to prove the lower bound $\lim \frac{\log p(n)}{\sqrt{n}} \ge C$ for the number of partitions $p(n)$ of $n$, where $C$ is an explicit constant.

Combinatorics · Mathematics 2019-05-28 Mark Wildon

The concept of geometric-arithmetic index was introduced in the chemical graph theory recently, but it has shown to be useful. The aim of this paper is to obtain new inequalities involving the geometric-arithmetic index $GA_1$ and…

Combinatorics · Mathematics 2017-03-17 Alvaro Martínez-Pérez , José M. Rodríguez

In the paper, the approximate sequence for entropy of some binary hidden Markov models has been found to have two bound sequences, the low bound sequence and the upper bound sequence. The error bias of the approximate sequence is bound by a…

Information Theory · Computer Science 2011-12-30 Shuangping Chen , Jun Li , Mi Zhou

Due to their importance in both data analysis and numerical algorithms, low rank approximations have recently been widely studied. They enable the handling of very large matrices. Tight error bounds for the computationally efficient…

Numerical Analysis · Mathematics 2023-04-06 Frank de Hoog , Markus Hegland

We describe reduced representatives for positive Rouquier complexes. These are obtained via Morse theoretical Gaussian elimination from the corresponding standard representatives. The underlying graded object is still a direct sum of…

Representation Theory · Mathematics 2024-08-06 Leonardo Maltoni

Given a truncated perturbation expansion of a physical quantity, one can, under certain circumstances, obtain lower or upper bounds (or both) to the sum of the full perturbation series by using the Borel transform and a variational…

High Energy Physics - Theory · Physics 2007-05-23 Rajesh R. Parwani

In this paper we continue the investigation of a real number object, i.e., an object representing the real numbers, in categories of relations. Our axiomatization is based on a relation algebraic version of Tarski's axioms of the real…

Logic · Mathematics 2026-01-14 Michael Winter

Let $X$ denote a nonnegative random variable with $\mathsf{E} X<\infty$. Upper and lower bounds on $\mathsf{E} X-\exp\mathsf{E}\ln X$ are obtained, which are exact, in terms of $V_X$ and $E_X$ for the upper bound and in terms of $V_X$ and…

Probability · Mathematics 2015-07-15 Iosif Pinelis