English
Related papers

Related papers: Bootstrapping partition regularity of linear syste…

200 papers

A $(k,\ell )$ partial partition of an $n$-element set is a collection of $\ell $ pairwise disjoint $k$-element subsets. It is proved that, if $n$ is large enough, one can find $\left\lfloor {n\choose k}/{\ell}\right\rfloor$ such partial…

Combinatorics · Mathematics 2023-12-15 Gyula O. H. Katona , Gyula Y. Katona

The following two decision problems capture the complexity of comparing integers or rationals that are succinctly represented in product-of-exponentials notation, or equivalently, via arithmetic circuits using only multiplication and…

Computational Complexity · Computer Science 2014-04-08 Kousha Etessami , Alistair Stewart , Mihalis Yannakakis

Given a sequence of $N$ positive real numbers $\{a_1,a_2,..., a_N \}$, the number partitioning problem consists of partitioning them into two sets such that the absolute value of the difference of the sums of $a_j$ over the two sets is…

adap-org · Physics 2009-10-30 F F Ferreira , J F Fontanari

Let $({\bf U},{\bf S},d)$ be an instance of Set Cover Problem, where ${\bf U}=\{u_1,...,u_n\}$ is a $n$ element ground set, ${\bf S}=\{S_1,...,S_m\}$ is a set of $m$ subsets of ${\bf U}$ satisfying $\bigcup_{i=1}^m S_i={\bf U}$ and $d$ is a…

Computational Complexity · Computer Science 2011-10-11 Hao Chen

The problem of detecting and removing redundant constraints is fundamental in optimization. We focus on the case of linear programs (LPs) in dictionary form, given by $n$ equality constraints in $n+d$ variables, where the variables are…

Computational Geometry · Computer Science 2014-12-04 Komei Fukuda , Bernd Gärtner , May Szedlák

We show that for any positive integer $d$, there are families of switched linear systems---in fixed dimension and defined by two matrices only---that are stable under arbitrary switching but do not admit (i) a polynomial Lyapunov function…

Optimization and Control · Mathematics 2015-04-16 Amir Ali Ahmadi , Raphael Jungers

I show analytically that the average of $k$ bootstrapped correlation matrices rapidly becomes positive-definite as $k$ increases, which provides a simple approach to regularize singular Pearson correlation matrices. If $n$ is the number of…

Computation · Statistics 2020-04-08 Christian Bongiorno

This study introduces a novel estimation method for the entries and structure of a matrix $A$ in the linear factor model $\mathbf{X} = A\textbf{Z} + \textbf{E}$. This is applied to an observable vector $\mathbf{X} \in \mathbb{R}^d$ with…

Statistics Theory · Mathematics 2024-10-18 Alexis Boulin

We establish a general structure theorem for the singular part of ${\mathscr A}$-free Radon measures, where ${\mathscr A}$ is a linear PDE operator. By applying the theorem to suitably chosen differential operators ${\mathscr A}$, we obtain…

Analysis of PDEs · Mathematics 2016-04-13 Guido De Philippis , Filip Rindler

In a previous paper of the second author with K. Ono, surprising multiplicative properties of the partition function were presented. Here, we deal with $k$-regular partitions. Extending the generating function for $k$-regular partitions…

Number Theory · Mathematics 2014-09-11 Olivia Beckwith , Christine Bessenrodt

Recently, Hirschhorn and Sellers defined the partition function $a_r(n)$, which counts the number of partitions of $n$ wherein even parts come in only one color, while the odd parts may appear in one of $r$-colors for fixed $r\ge1$. The aim…

Number Theory · Mathematics 2025-11-19 M. P. Thejitha , S. N. Fathima

For a vector $\mathbf a=(a_1,\ldots,a_r)$ of positive integers we prove formulas for the restricted partition function $p_{\mathbf a}(n): = $ the number of integer solutions $(x_1,\dots,x_r)$ to $\sum_{j=1}^r a_jx_j=n$ with $x_1\geq 0,…

Combinatorics · Mathematics 2018-12-11 Mircea Cimpoeas , Florin Nicolae

We give sufficient conditions on a matrix A ensuring the existence of a partition of this matrix into two submatrices with extremely small norm of the image of any vector. Under some weak conditions on a matrix A we obtain a partition of A…

Functional Analysis · Mathematics 2020-09-24 Irina Limonova

We prove that for each integer $r\geq 2$, there exists a constant $C_r>0$ with the following property: for any $0<\varepsilon \leq 1/2$ and any graph $G$ with clique number at most $r,$ there is a partition of $V(G)$ into at most…

Combinatorics · Mathematics 2024-12-02 António Girão , Toby Insley

We prove, using the subspace embedding guarantee in a black box way, that one can achieve the spectral norm guarantee for approximate matrix multiplication with a dimensionality-reducing map having $m = O(\tilde{r}/\varepsilon^2)$ rows.…

Data Structures and Algorithms · Computer Science 2016-03-03 Michael B. Cohen , Jelani Nelson , David P. Woodruff

Let $R$ be a ring essentially of finite type over an $F$-finite field. Given an ideal $\mathfrak{a}$ and a principal Cartier module $M$ we introduce the notion of a $V$-filtration of $M$ along $\mathfrak{a}$. If $M$ is $F$-regular then this…

Algebraic Geometry · Mathematics 2014-12-24 Axel Stäbler

Let A be a commutative noetherian ring. Call a functor <<commutative A-algebras>> --> <<sets>> coherent if it can be built up (via iterated finite limits) from functors of the form B \mapsto M tensor_A B, where M is a f.g. A-module. When…

alg-geom · Mathematics 2015-06-30 David B. Jaffe

Suppose that $A \subset \mathbb{R}$ has positive upper density, \[ \limsup_{|I| \to \infty} \frac{|A \cap I|}{|I|} = \delta > 0,\] and $P(t) \in \mathbb{R}[t]$ is a polynomial with no constant or linear term, or more generally a non-flat…

Classical Analysis and ODEs · Mathematics 2019-01-08 Ben Krause

A matrix A is image partition regular over Q provided that whenever Q - {0} is finitely coloured, there is a vector x with entries in Q - {0} such that the entries of Ax are monochromatic. It is kernel partition regular over Q provided that…

Combinatorics · Mathematics 2016-09-13 Neil Hindman , Imre Leader , Dona Strauss

The entropy accumulation theorem states that the smooth min-entropy of an $n$-partite system $A = (A_1, \ldots, A_n)$ is lower-bounded by the sum of the von Neumann entropies of suitably chosen conditional states up to corrections that are…

Quantum Physics · Physics 2019-07-23 Frédéric Dupuis , Omar Fawzi
‹ Prev 1 3 4 5 6 7 10 Next ›