Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

2457 · Mar 202319922001200920172026
48 results for Löbell polyhedra

Bell's theorem shows quantum correlations can't be explained by classical causal models, even with some measurement dependence.

problem Quantum correlations violate classical causal models.
method Using causal networks, the study bounds the level of measurement dependence and derives nonlinear Bell inequalities.
result Quantum correlations can't be explained by classical causal models even with some measurement dependence.

Quantum theory challenges traditional cause-effect relations, showing causal influences even without Bell inequality violations.

problem Challenging traditional concepts of cause-effect relations in quantum mechanics.
method Introducing a general framework to estimate causal influences without interventions or classical/quantum assumptions.
result Every pure bipartite entangled state violates classical bounds on causal influence, negating the idea that Bell inequalities are the only signature of incompatibility.

It has recently been found that Bell scenarios are only a small subclass of interesting setups for studying the non-classical features of quantum theory within spacetime. We find that it is possible to talk about classical correlations, quantum correlations and other kinds of correlations on any directed acyclic graph,…

2014-04-18abs ↗pdf ↗

Löbell polyhedra have small systoles and are quasi-arithmetic.

problem Finding compact hyperbolic polyhedra with small systoles.
method Elementary and conceptual means to observe systole behavior, number theoretic invariants to refine results.
result Löbell polyhedra give examples of closed hyperbolic 3-manifolds with arbitrarily small systole and are quasi-arithmetic.

We study convex polyhedra in RP3\mathbb{R}\mathbb{P}^3 with all their vertices on a sphere. We do not require, in particular, that the polyhedra lie in the interior of the sphere, hence the term "weakly inscribed". Such polyhedra can be interpreted as ideal polyhedra, if we regard RP3\mathbb{R}\mathbb{P}^3 as a combinati…

2017-09-29abs ↗pdf ↗

We review several results related to the characterization of polyhedra in hyperbolic 3-space. In particular we present Rivin's theorem that gives a characterization of compact convex hyperbolic polyhedra, and Hodgson's proof of the Adreev's theorem. We also review the analogous characterization of ideal polyhedra, and …

2010-06-23abs ↗pdf ↗

In this paper we consider a class of right-angled polyhedra in three-dimensional Lobachevsky space, all vertices of which lie on the absolute. New upper bounds on volumes in terms the number of faces of the polyhedron are obtained. Volumes of polyhedra with at most 23 faces are computed. It is shown that the minimum vo…

2019-09-25abs ↗pdf ↗

This article defines a pair of combinatorial operations on the combinatorial structure of compact right-angled hyperbolic polyhedra in dimension three called decomposition and edge surgery. It is shown that these operations simplify the combinatorics of such a polyhedron, while keeping it within the class of right-angl…

2008-09-11abs ↗pdf ↗

We present a notion of mutation of hyperbolic polyhedra, analogous to mutation in knot theory, and then present a general question about commensurability of mutant pairs of polyhedra. We motivate that question with several concrete examples of mutant pairs for which commensurability is unknown. The polyhedra we conside…

2019-06-20abs ↗pdf ↗

New families of hyperbolic polyhedra yield infinitely many unique reflection groups.

problem Understanding commensurability classes of compact Coxeter polyhedra in hyperbolic spaces.
method Analyzing families of compact Coxeter polyhedra constructed by Makarov.
result Proves infinitely many commensurability classes in 4- and 5-dimensional hyperbolic spaces.

The paper solves three problems related to monostable polyhedra.

problem Three problems related to monostable polyhedra posed by Conway and Goldberg.
method General theorem describing approximations of smooth convex bodies by convex polyhedra in terms of static equilibrium points.
result Existence of a convex polyhedron with only one stable and one unstable point.

In this article we establish the relation between the spines of 3-manifolds and the polyhedra with identified faces. We do this by showing that the spines of the closed, connected, orientable 3-manifolds can be presented through polyhedra with identified faces in a very natural way. We also prove the equivalence betwee…

2012-04-16abs ↗pdf ↗

Paper solves long-standing problem of infinite ideal polyhedra in hyperbolic space.

problem Characterize infinite ideal polyhedra in hyperbolic 3-space.
method Introduced combinatorial Ricci flow for infinite ideal circle patterns.
result Proved characterization of infinite ideal circle patterns under specific conditions.

The ability to witness non-local correlations lies at the core of foundational aspects of quantum mechanics and its application in the processing of information. Commonly, this is achieved via the violation of Bell inequalities. Unfortunately, however, their systematic derivation quickly becomes unfeasible as the scena…

2018-08-21abs ↗pdf ↗

An algorithm for determining the list of smallest volume right-angled hyperbolic polyhedra in dimension 3 is described. This algorithm has been implemented on computer using the program Orb to compute volumes, and the first 825 polyhedra in the list have been determined.

2015-12-06abs ↗pdf ↗

Software finds ideal polyhedra with rational dihedral angles and volume maxima.

problem Finding ideal convex polyhedra with maximal volume in hyperbolic 3-space.
method Rivin's variational characterization and combinatorial optimization algorithms.
result Maximal volume ideal polyhedra have dihedral angles that are rational multiples of π.

Soft diamond regularizers improve deep learning performance and sparsity.

problem Improving deep learning performance and sparsity of trained weights.
method New soft diamond synaptic weight priors based on thick-tailed symmetric alpha stable probability curves.
result Soft diamond regularizers outperform state-of-the-art methods in deep learning tasks.

The paper proves rigidity and uniformization theorems for infinite circle patterns and convex polyhedra in hyperbolic 3-space.

problem Characterize infinite circle patterns and convex polyhedra in hyperbolic 3-space.
method Extends techniques from previous work to prove rigidity and uniformization theorems for infinite circle patterns and convex polyhedra.
result Establishes existence and rigidity of infinite regular circle patterns and convex trivalent polyhedra.

In [6], Kellerhals and Perren conjectured that the growth rates of the reflection groups given by hyperbolic Coxeter polyhedra are always Perron numbers. We prove that this conjecture is always true for the case of ideal Coxeter polyhedra in H3\mathbb{H}^3. We also find out the ideal Coxeter polyhedron in $\mathbb{H}^3…

2015-04-25abs ↗pdf ↗

New bounds found for vertices of hyperbolic polyhedra in dimensions 5 to 12.

problem Determining minimum number of ideal and finite vertices in hyperbolic polyhedra.
method Geometric method of orthogonal gluings combined with double counting and recurrence relations.
result Improved lower bounds for vertices in all dimensions up to 12.

We define the injectivity radius of a Coxeter polyhedron in H^3 to be half the shortest translation length among hyperbolic/loxodromic elements in the orientation-preserving reflection group. We show that, for finite-volume polyhedra, this number is always less than 2.6339..., and for compact polyhedra it is always les…

1998-12-11abs ↗pdf ↗

Many widely studied graphical models with latent variables lead to nontrivial constraints on the distribution of the observed variables. Inspired by the Bell inequalities in quantum mechanics, we refer to any linear inequality whose violation rules out some latent variable model as a "hidden variable test" for that mod…

2011-06-08abs ↗pdf ↗

We analyze the topology and geometry of a polyhedron of dimension 2 according to the minimum size of a cover by PL collapsible polyhedra. We provide partial characterizations of the polyhedra of dimension 2 that can be decomposed as the union of two PL collapsible subpolyhedra in terms of their simple homotopy type and…

2018-02-05abs ↗pdf ↗

Classical H.Minkowski theorems on existence and uniqueness of convex polyhedra with prescribed directions and areas of faces as well as the well-known generalization of H.Minkowski uniqueness theorem due to A.D.Alexandrov are extended to a class of nonconvex polyhedra which are called polyhedral herissons and may be de…

2002-11-19abs ↗pdf ↗

We present proofs of basic results, including those developed by Harold Bell, for the plane fixed point problem: does every map of a non-separating plane continuum have a fixed point? Some of these results had been announced much earlier by Bell but without accessible proofs. We define the concept of the variation of a…

2010-04-01abs ↗pdf ↗