Results 1 to 10 of about 96,047 (264)
The lower bounds for the rank of matrices and some sufficient conditions for nonsingular matrices [PDF]
Journal of Inequalities and Applications, 2017 The paper mainly discusses the lower bounds for the rank of matrices and sufficient conditions for nonsingular matrices. We first present a new estimation for ∑ i = 1 n | λ i | 2 $\sum_{i=1}^{n} \vert \lambda_{i} \vert ^{2}$ ( λ i $\lambda_{i}$ is an ...
Dafei Wang, Xumei Zhang
doaj +2 more sources
Lower Bounds for Nonrelativistic Atomic Energies [PDF]
ACS Physical Chemistry Au, 2021 Robbie T. Ireland +5 more
doaj +2 more sources
Lower bounds for the low-rank matrix approximation [PDF]
Journal of Inequalities and Applications, 2017 Low-rank matrix recovery is an active topic drawing the attention of many researchers. It addresses the problem of approximating the observed data matrix by an unknown low-rank matrix. Suppose that A is a low-rank matrix approximation of D, where D and A
Jicheng Li, Zisheng Liu, Guo Li
doaj +2 more sources
Upper and lower bounds for the Bregman divergence [PDF]
Journal of Inequalities and Applications, 2019 In this paper we study upper and lower bounds on the Bregman divergence ΔFξ(y,x):=F(y)−F(x)−〈ξ,y−x〉 $\Delta_{\mathcal {F}}^{\xi }(y,x):=\mathcal {F}(y)-\mathcal {F}(x)- \langle \xi , y-x \rangle$ for some convex functional F $\mathcal {F}$ on a normed ...
Benjamin Sprung
doaj +2 more sources
Lower Bounds on Stabilizer Rank [PDF]
Quantum, 2022 The $\textit{stabilizer rank}$ of a quantum state $\psi$ is the minimal $r$ such that $\left| \psi \right \rangle = \sum_{j=1}^r c_j \left|\varphi_j \right\rangle$ for $c_j \in \mathbb{C}$ and stabilizer states $\varphi_j$.
Shir Peleg, Amir Shpilka, Ben Lee Volk
doaj +1 more source
Lower bounds for blow up time of the p-Laplacian equation with damping term [PDF]
Mathematica Moravica, 2021 In this work deals with the p-Laplacian wave equation with damping terms in a bounded domain. Under suitable conditions, we obtain a lower bounds for the blow up time.
Dınç Yavuz +2 more
doaj +1 more source
A parameterized lower bounding method for the open capacitated arc routing problem
EURO Journal on Computational Optimization, 2023 Consider an undirected graph with demands scattered over the edges and a homogeneous fleet of vehicles to service the demands. In the open capacitated arc routing problem (OCARP) the objective is to find a set of routes that collectively service all ...
Rafael Kendy Arakaki +1 more
doaj +1 more source
Large Independent Sets on Random d-Regular Graphs with Fixed Degree d
Computation, 2023 The maximum independent set problem is a classic and fundamental combinatorial challenge, where the objective is to find the largest subset of vertices in a graph such that no two vertices are adjacent.
Raffaele Marino, Scott Kirkpatrick
doaj +1 more source
Two lower bounds for $p$-centered colorings [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 Given a graph $G$ and an integer $p$, a coloring $f : V(G) \to \mathbb{N}$ is \emph{$p$-centered} if for every connected subgraph $H$ of $G$, either $f$ uses more than $p$ colors on $H$ or there is a color that appears exactly once in $H$. The notion of $
Loïc Dubois +4 more
doaj +1 more source
Discrete Analysis, 2023 New lower bounds for cap sets, Discrete Analysis 2023:20, 18 pp. One of the best known problems in additive combinatorics, the cap set problem, asks how large a subset of $\mathbb F_3^n$ can be if it contains no non-trivial solutions to the equation $x ...
Fred Tyrrell
doaj +1 more source