English
Related papers

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

200 papers

In this short paper we show that March's criterion for the existence of a bounded non constant harmonic function on a weak model is also a necessary and sufficient condition for the solvability of the Dirichlet problem at infinity on a…

Differential Geometry · Mathematics 2023-05-30 Jhon E. Bravo , Jean C. Cortissoz

The strong maximum principle is proved to hold for weak (in the sense of support functions) sub- and super-solutions to a class of quasi-linear elliptic equations that includes the mean curvature equation for $C^0$ spacelike hypersurfaces…

dg-ga · Mathematics 2008-02-03 L. Andersson , G. J. Galloway , R. Howard

Random constraint satisfaction problems (CSPs) such as random $3$-SAT are conjectured to be computationally intractable. The average case hardness of random $3$-SAT and other CSPs has broad and far-reaching implications on problems in…

Computational Complexity · Computer Science 2019-11-11 Jonah Brown-Cohen , Prasad Raghavendra

In this paper, the authors provide a weak decoding version of the traditional source coding theorem of Claude Shannon. The central bound that is obtained is \[ \chi>\log_{\epsilon}(2^{-n(H(X)+\epsilon)}) \] where \[…

Information Theory · Computer Science 2022-09-13 Aman Chawla

Observation of top quark flavor changing neutral process $t\to c +\gamma$ at the LHC would be the signal of physics beyond the Standard Model. If anomalous $t\to c\gamma$ coupling exists, it will affect the precisely measured…

High Energy Physics - Phenomenology · Physics 2011-02-01 Xing-Bo Yuan , Yang Hao , Ya-Dong Yang

Nonnegativity certificates can be used to obtain tight dual bounds for polynomial optimization problems. Hierarchies of certificate-based relaxations ensure convergence to the global optimum, but higher levels of such hierarchies can become…

Optimization and Control · Mathematics 2023-04-25 Ksenia Bestuzheva , Helena Völker , Ambros Gleixner

Using some new observations connected to higher energies, we obtain quantitative lower bounds on $\max\{|AB|, |A+C| \}$ and $\max\{|(A+\alpha)B|, |A+C|\}$, $\alpha \neq 0$ in the regime when the sizes of finite subsets $A,B,C$ of a field…

Number Theory · Mathematics 2018-08-22 Ilya D. Shkredov

In this paper, we consider the problem of binary classification with a class of general deep convolutional neural networks, which includes fully-connected neural networks and fully convolutional neural networks as special cases. We…

Machine Learning · Computer Science 2021-05-04 Guohao Shen , Yuling Jiao , Yuanyuan Lin , Jian Huang

We present a new algorithm for improving lower bounds on $ex(n;\{C_3,C_4\})$, the maximum size (number of edges) of an $n$-vertex graph of girth at least 5. The core of our algorithm is a variant of a hill-climbing heuristic introduced by…

Combinatorics · Mathematics 2025-08-08 Jan Goedgebeur , Jorik Jooken , Gwenaël Joret , Tibo Van den Eede

We propose an algorithm to find a lower bound for the number of cyclic codes over any finite field with any given exponent. Besides, we give a formula to find the exponent of BCH codes.

Information Theory · Computer Science 2022-09-01 Anuj Kumar Bhagat , Ritumoni Sarma

In this paper we study elliptic equations with a nonlinear conormal derivative boundary condition involving nonstandard growth terms. By means of the localization method and De Giorgi's iteration technique we derive global a priori bounds…

Analysis of PDEs · Mathematics 2015-10-05 Patrick Winkert , Rico Zacher

Exploring the power of linear programming for combinatorial optimization problems has been recently receiving renewed attention after a series of breakthrough impossibility results. From an algorithmic perspective, the related questions…

Discrete Mathematics · Computer Science 2014-12-31 Stavros G. Kolliopoulos , Yannis Moysoglou

Determining the asymptotic algebraic complexity of matrix multiplication, succinctly represented by the matrix multiplication exponent $\omega$, is a central problem in algebraic complexity theory. The best upper bounds on $\omega$, leading…

Computational Complexity · Computer Science 2022-03-08 Matthias Christandl , Péter Vrana , Jeroen Zuiddam

We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…

Combinatorics · Mathematics 2015-02-10 Aleksi Saarela

Duan, Wu and Zhou (FOCS 2023) recently obtained the improved upper bound on the exponent of square matrix multiplication $\omega<2.3719$ by introducing a new approach to quantify and compensate the ``combination loss" in prior analyses of…

Data Structures and Algorithms · Computer Science 2023-12-29 François Le Gall

Given a random $n \times n$ symmetric matrix $\boldsymbol W$ drawn from the Gaussian orthogonal ensemble (GOE), we consider the problem of certifying an upper bound on the maximum value of the quadratic form $\boldsymbol x^\top \boldsymbol…

Data Structures and Algorithms · Computer Science 2019-04-09 Afonso S. Bandeira , Dmitriy Kunisky , Alexander S. Wein

We consider inhomogeneous matrix products over max-plus algebra, where the matrices in the product satisfy certain assumptions under which the matrix products of sufficient length be rank-one, as it was shown in [6][L. Shue, B.D.O.…

Rings and Algebras · Mathematics 2019-04-15 Arthur Kennedy Cochran Patrick , Sergei Sergeev , Štefan Berežný

A Maxwell-Stefan system for fluid mixtures with driving forces depending on Cahn-Hilliard-type chemical potentials is analyzed. The corresponding parabolic cross-diffusion equations contain fourth-order derivatives and are considered in a…

Analysis of PDEs · Mathematics 2022-05-16 Xiaokai Huo , Ansgar Jüngel , Athanasios E. Tzavaras

This work examines risk bounds for nonparametric distributional regression estimators. For convex-constrained distributional regression, general upper bounds are established for the continuous ranked probability score (CRPS) and the…

Given $n$ weighted points (positive or negative) in $d$ dimensions, what is the axis-aligned box which maximizes the total weight of the points it contains? The best known algorithm for this problem is based on a reduction to a related…

Data Structures and Algorithms · Computer Science 2016-03-04 Arturs Backurs , Nishanth Dikkala , Christos Tzamos
‹ Prev 1 4 5 6 7 8 10 Next ›