Related papers: A new bound of concurrence

A new entanglement measure, which is called D-concurrence, is proposed. Then the upper and lower bounds for D-concurrence are obtained and the relationship between D-concurrence and the usual concurrence of Wootters was established. In…

New lower bounds involving sum, difference, product, and ratio sets for $A\subset \C$ are given.

We model competition on a credence goods market governed by an imperfect label, signaling high quality, as a rank-order tournament between firms. In this market interaction, asymmetric firms jointly and competitively control the aggregate…

We improve the previuosly known bound for some vertex Folkman numbers.

An technically interesting proof of a known theorem.

We slightly improve the known lower bound on the asymptotic competitive ratio for online bin packing of rectangles. We present a complete proof for the new lower bound, whose value is above 1.91.

Young's integral inequality is complemented with an upper bound to the remainder. The new inequality turns out to be equivalent to Young's inequality, and the cases in which the equality holds become particularly transparent in the new…

In this note, we find a new inequality involving primes and deduce several Bonse-type inequalities.

We give an improved lower bound of 10/3 on the competitive ratio for the exploration of an undirected, edge-weighted graph with a single agent that needs to return to the starting location after visiting all vertices. We assume that the…

A bandwidth puzzle was recently proposed to defend against colluding adversaries in peer-to-peer networks. The colluding adversaries do not do actual work but claim to have uploaded contents for each other to gain free credits from the…

We give a new recurrent inequality on a class of vertex Folkman numbers.

We study the dynamics of upper and lower bounds of squared concurrence.Our results are similar to that of Konard et al. and can help the estimation of high-dimension bipartite entanglement in experiments.

We formulate a general approach to higher concurrencies in general and neural codes in particular, and suggest how the higher order aspects may be dealt with in using topology.

Concurrence is an important entanglement measure for states in finite-dimensional quantum systems that was explored intensively in the last decade. In this paper, we extend the concept of concurrence to infinite-dimensional bipartite…

We extend the model of Parenti (2018) on large and small firms by introducing cost heterogeneity among small firms. We propose a novel necessary and sufficient condition for the existence of such a mixed market structure. Furthermore, in…

We give some bounds on edge Folkman numbers.

We give a counterexample to a recently conjectured variant of the Penrose inequality.

A variation on the splitting principle

A new axiom for rules for claims problems is introduced. It strengthens a condition studied in supply chain literature, which forces rules to disincentivize order inflation under capacity allocation and retail competition. The relevance of…

We give an new proof of the well-known competitive exclusion principle in the chemostat model with $n$ species competing for a single resource, for any set of increasing growth functions. The proof is constructed by induction on the number…