Results 31 to 40 of about 563,274 (244)
Holographic quantum entanglement negativity
We advance a holographic conjecture for the entanglement negativity of bipartite quantum states in (1 + 1)-dimensional conformal field theories in the AdS 3 /CF T 2 framework.
Pankaj Chaturvedi +2 more
doaj +1 more source
Joints formed by lines and a $k$-plane, and a discrete estimate of Kakeya type
In 2008, Zeev Dvir solved the finite-field Kakeya conjecture using the polynomial method. His remarkably short argument led to a burst of activity, which in turn led to the solution of a number of other problems using the polynomial method, a notable ...
Anthony Carbery, Marina Iliopoulou
doaj +1 more source
Reduced Collatz Dynamics Data Reveals Properties for the Future Proof of Collatz Conjecture
Collatz conjecture is also known as 3X + 1 conjecture. For verifying the conjecture, we designed an algorithm that can output reduced dynamics (occurred 3 × x + 1 or x/2 computations from a starting integer to the first integer smaller than the ...
Wei Ren
doaj +1 more source
Bounding the monomial index and (1,l)-weight choosability of a graph [PDF]
Graph ...
Ben Seamone
doaj +1 more source
On the conjecture of Je$ \acute{\textbf{s}} $manowicz
Let $ k, l, m_1 $ and $ m_2 $ be positive integers and let both $ p $ and $ q $ be odd primes such that $ p^k = 2^{m_1}-a^{m_2} $ and $ q^l = 2^{m_1}+a^{m_2} $ where $ a $ is a positive integer with $ a\equiv {\pm 3}\pmod 8 $.
Nan Fan , Jiagui Luo
doaj +1 more source
Neighbour-sum-2-distinguishing edge-weightings: Doubling the 1–2–3 Conjecture [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Baudon, Olivier +3 more
openaire +2 more sources
A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Akbar Davoodi, Leila Maherani
openaire +7 more sources
Pushing Vertices to Make Graphs Irregular [PDF]
In connection with the so-called 1-2-3 Conjecture, we introduce and study a new problem related to proper labellings. In the regular problem, proper labellings of graphs are designed by assigning strictly positive labels to the edges so that any two ...
Julien Bensmail +2 more
doaj +1 more source
On two conjectures of Maurer concerning basis graphs of matroids [PDF]
We characterize 2-dimensional complexes associated canonically with basis graphs of matroids as simply connected triangle-square complexes satisfying some local conditions. This proves a version of a (disproved) conjecture by Stephen Maurer (Conjecture 3
Chalopin, Jérémie +2 more
core +3 more sources
(Quasi-) de Sitter solutions across dimensions and the TCC bound
In this work, we investigate the existence of string theory solutions with a d-dimensional (quasi-) de Sitter spacetime, for 3 ≤ d ≤ 10. Considering classical compactifications, we derive no-go theorems valid for general d. We use them to exclude (quasi-)
David Andriot, Ludwig Horer
doaj +1 more source

