English
Related papers

Related papers: Weak CSR expansions and transience bounds in max-p…

200 papers

As explained in detail in the prologue to this manuscript, boundedness of weak solutions for general classes of elliptic equations in divergence form is a classic tool for achieving higher regularity. We propose here some global boundedness…

Analysis of PDEs · Mathematics 2025-12-23 Giovanni Cupini , Paolo Marcellini

The aim of this article is to study a Cahn-Hilliard model for a multicomponent mixture with cross-diffusion effects, degenerate mobility and where only one of the species does separate from the others. We define a notion of weak solution…

Analysis of PDEs · Mathematics 2020-07-03 Virginie Ehrlacher , Greta Marino , Jan-Frederik Pietschmann

We use the algebraic structure of cyclic codes and some properties of the discrete Fourier transform to give a reformulation of several classical bounds for the distance of cyclic codes, by extending techniques of linear algebra. We propose…

Information Theory · Computer Science 2016-04-01 Matteo Piva , Massimiliano Sala

We analyse the capacity of several two-dimensional constraint families - the exclusion, colouring, parity and charge model families. Using Baxter's corner transfer matrix formalism combined with the corner transfer matrix renormalisation…

Combinatorics · Mathematics 2014-05-26 Yao-ban Chan , Andrew Rechnitzer

For substructural logics with contraction or weakening admitting cut-free sequent calculi, proof search was analyzed using well-quasi-orders on $\mathbb{N}^d$ (Dickson's lemma), yielding Ackermannian upper bounds via controlled bad-sequence…

Logic in Computer Science · Computer Science 2026-02-24 A. R. Balasubramanian , Vitor Greati , Revantha Ramanayake

We study the MaxRes rule in the context of certifying unsatisfiability. We show that it can be exponentially more powerful than tree-like resolution, and when augmented with weakening (the system MaxResW), p-simulates tree-like resolution.…

Computational Complexity · Computer Science 2023-04-13 Yuval Filmus , Meena Mahajan , Gaurav Sood , Marc Vinyals

While many bounds have been proved for partial trace inequalities over the last decades for a large variety of quantities, recent problems in quantum information theory demand sharper bounds. In this work, we study optimal bounds for…

Quantum Physics · Physics 2026-01-21 Pablo Costa Rico , Pavel Shteyner

We analyze site percolation on directed and undirected graphs with site-dependent open-site probabilities. We construct upper bounds on cluster susceptibilities, vertex connectivity functions, and the expected number of simple open cycles…

Mathematical Physics · Physics 2016-10-18 Kathleen E. Hamilton , Leonid P. Pryadko

We consider a class of cross diffusion systems with degenerate (or porous media type) diffusion which is inspired by models in mathematical biology/ecology with zero self diffusions. Known techniques for scalar equations are no longer…

Analysis of PDEs · Mathematics 2019-09-12 Dung Le

The restricted strong convexity is an effective tool for deriving globally linear convergence rates of descent methods in convex minimization. Recently, the global error bound and quadratic growth properties appeared as new competitors. In…

Optimization and Control · Mathematics 2016-06-21 Hui Zhang

The weak-strong uniqueness of solutions to a broad class of cross-diffusion systems with volume filling is established. In general, the diffusion matrices are neither symmetric nor positive definite. This issue is overcome by supposing that…

Analysis of PDEs · Mathematics 2025-10-01 Maria Heitzinger , Ansgar Jüngel

We investigate matrix-weighted bounds for the sublinear non-kernel operators considered by F. Bernicot, D. Frey, and S. Petermichl. We extend their result to sublinear operators acting upon vector-valued functions. First, we dominate these…

Classical Analysis and ODEs · Mathematics 2024-04-26 Spyridon Kakaroumpas , Thu Hien Nguyen , Dimitris Vardakis

This paper derives exponential tail bounds and polynomial moment inequalities for the spectral norm deviation of a random matrix from its mean value. The argument depends on a matrix extension of Stein's method of exchangeable pairs for…

Probability · Mathematics 2013-05-06 Daniel Paulin , Lester Mackey , Joel A. Tropp

In this paper we propose a new scaling method to study the Schur complements of $SDD_{1}$ matrices. Its core is related to the non-negative property of the inverse $M$-matrix, while numerically improving the Quotient formula. Based on the…

Numerical Analysis · Mathematics 2025-04-22 Yang Hu , Jianzhou Liu , Wenlong Zeng

An important yet challenging problem in numerical linear algebra is finding a principal submatrix with maximum determinant from a given symmetric positive semidefinite matrix. This problem arises in experimental design, statistics, and…

Optimization and Control · Mathematics 2026-05-26 Hao Hu , Stefan Sremac , Hugo J. Woerdeman , Henry Wolkowicz

We perturb a real matrix $A$ of full column rank, and derive lower bounds for the smallest singular values of the perturbed matrix, in terms of normwise absolute perturbations. Our bounds, which extend existing lower-order expressions,…

Numerical Analysis · Mathematics 2024-02-22 Christos Boutsikas , Petros Drineas , Ilse C. F. Ipsen

Using the two way distance, we introduce the concepts of weak metric dimension of a strongly connected digraph $\Gamma$. We first establish lower and upper bounds for the number of arcs in $\Gamma$ by using the diameter and weak metric…

Combinatorics · Mathematics 2020-12-08 Min Feng , Kaishun Wang , Yuefeng Yang

The paper provides new upper and lower bounds for the multivariate Laplace approximation under weak local assumptions. Their range of validity is also given. An application to an integral arising in the extension of the Dixon's identity is…

Classical Analysis and ODEs · Mathematics 2016-04-12 Piotr Majerski

A new lower bound on the minimum Hamming distance of linear quasi-cyclic codes over finite fields is proposed. It is based on spectral analysis and generalizes the Semenov- Trifonov bound in a similar way as the Hartmann-Tzeng bound extends…

Information Theory · Computer Science 2016-11-15 Alexander Zeh , San Ling

We derive and implement a new way to find lower bounds on the smallest limiting trace-to-degree ratio of totally positive algebraic integers and improve the previously best known bound to 1.80203. Our method adds new constraints to Smyth's…

Number Theory · Mathematics 2024-09-26 Bryce Joseph Orloski , Naser Talebizadeh Sardari , Alexander Smith