English
Related papers

Related papers: The pinning ideal of a multiloop

200 papers

A pinch point singularity in the structure factor characterizes an important class of condensed matter that is a counterpoint to the paradigm of broken symmetry. This class includes water ice, charge ice and spin ice. Of these, dipolar spin…

Strongly Correlated Electrons · Physics 2020-03-16 Mikael Twengström , Patrik Henelius , Steven T. Bramwell

It is well-known that a connected regular graph is strongly-regular if and only if its adjacency matrix has exactly three eigenvalues. Let $B$ denote an integral square matrix and $\langle B \rangle$ denote the subring of the full matrix…

Combinatorics · Mathematics 2016-08-31 Mitsugu Hirasaka , Semin Oh

The problem of interpolation at $(n+1)^2$ points on the unit sphere $\mathbb{S}^2$ by spherical polynomials of degree at most $n$ is proved to have a unique solution for several sets of points. The points are located on a number of circles…

Numerical Analysis · Mathematics 2007-05-23 Wolfgang zu Castell , Noemi Lain Fernandez , Yuan Xu

Two fundamental objects in knot theory are the minimal genus surface and the least area surface bounded by a knot in a 3-dimensional manifold. When the knot is embedded in a general 3-manifold, the problems of finding these surfaces were…

Computational Geometry · Computer Science 2011-03-24 Nathan M. Dunfield , Anil N. Hirani

We provide a mathematical realization of a conjecture by Kitaev, on the basis of the operator-algebraic formulation of infinite quantum spin systems. Our main results are threefold. First, we construct an $\Omega$-spectrum $\mathit{IP}_*$…

Mathematical Physics · Physics 2025-12-30 Yosuke Kubota

We prove that, given a closure function the smallest preimage of a closed set can be calculated in polynomial time in the number of closed sets. This confirms a conjecture of Albenque and Knauer and implies that there is a polynomial time…

Combinatorics · Mathematics 2018-05-01 Kolja Knauer , Nicolas Nisse

We prove a generalization of the classical Borsuk--Ulam Theorem under small perturbations (shaking) of the sphere. We show that for a generic perturbation of a continuous map $f : S^2 \to \mathbb{R}^2$, the number of points $x \in S^2$ such…

General Mathematics · Mathematics 2025-07-24 Karim Mansour

Consider a random set of points on the unit sphere in $\mathbb{R}^d$, which can be either uniformly sampled or a Poisson point process. Its convex hull is a random inscribed polytope, whose boundary approximates the sphere. We focus on the…

Metric Geometry · Mathematics 2020-07-16 Arseniy Akopyan , Herbert Edelsbrunner , Anton Nikitenko

Numerical integration methods are central to the study of self-gravitating systems, particularly those comprised of many bodies or otherwise beyond the reach of analytical methods. Predictor-corrector schemes, both multi-step methods and…

Instrumentation and Methods for Astrophysics · Physics 2025-01-24 Alexander J. Dittmann

Most quantum circuits require SWAP gate insertion to run on quantum hardware with limited qubit connectivity. A promising SWAP gate insertion method for blocks of commuting two-qubit gates is a predetermined swap strategy which applies…

Quantum Physics · Physics 2023-08-01 Atsushi Matsuo , Shigeru Yamashita , Daniel J. Egger

A non-negative integer invariant, estimating from below the number of geometrically different critical points of a smooth function $f$ defined in the 2-disk, $f:\mathbb{B}^{2}\rightarrow\mathbb{R}$, is considered. (We denote it by…

Geometric Topology · Mathematics 2018-10-10 Simeon Stefanov

It is well known that selecting a good Mixed Integer Programming (MIP) formulation is crucial for an effective solution with state-of-the art solvers. While best practices and guidelines for constructing good formulations abound, there is…

Optimization and Control · Mathematics 2017-05-23 Juan Pablo Vielma

$ \newcommand{\inparen}[1]{\left( #1 \right)} \newcommand{\pfrac}[2]{\inparen{\frac{1}{2}}} \newcommand{\ilog}[1]{\log^{\circ #1}} \newcommand{\F}{\mathbb{F}} $The Polynomial Identity Lemma (also called the "Schwartz--Zippel lemma") states…

Computational Complexity · Computer Science 2024-12-09 Mrinal Kumar , Ramprasad Saptharishi , Anamay Tengse

We consider a large family of problems in which an ordering (or, more precisely, a chain of subsets) of a finite set must be chosen to minimize some weighted sum of costs. This family includes variations of Min Sum Set Cover (MSSC), several…

Data Structures and Algorithms · Computer Science 2021-06-28 Felix Happach , Lisa Hellerstein , Thomas Lidbetter

Let $d$ be a positive integer. For a finite set $X \subseteq \mathbb{R}^d$, we define its integer cone as the set $\mathsf{IntCone}(X) := \{ \sum_{x \in X} \lambda_x \cdot x \mid \lambda_x \in \mathbb{Z}_{\geq 0} \} \subseteq \mathbb{R}^d$.…

Data Structures and Algorithms · Computer Science 2023-07-04 Łukasz Kowalik , Alexandra Lassota , Konrad Majewski , Michał Pilipczuk , Marek Sokołowski

Enumerating minimal transversals in a hypergraph is a notoriously hard problem. It can be reduced to enumerating minimal dominating sets in a graph, in fact even to enumerating minimal dominating sets in an incomparability graph. We provide…

Discrete Mathematics · Computer Science 2025-11-27 Marthe Bonamy , Oscar Defrain , Piotr Micek , Lhouari Nourine

A fully numerical method to calculate loop integrals, a numerical contour-integration method, is proposed. Loop integrals can be interpreted as a contour integral in a complex plane for an integrand with multi-poles in the plane. Stable and…

High Energy Physics - Phenomenology · Physics 2009-11-11 Y. Kurihara , T. Kaneko

This paper proposes a novel, nonparametric, interpoint distance-based measure to investigate whether there exist any groups in a set of given data, and if so then, how many groups are prevailing in total. It is a cluster accuracy index…

Methodology · Statistics 2026-05-21 Soumita Modak

We give a $n^{O(\log n)}$-time ($n$ is the input size) blackbox polynomial identity testing algorithm for unknown-order read-once oblivious algebraic branching programs (ROABP). The best result known for this class was $n^{O(\log^2 n)}$ due…

Computational Complexity · Computer Science 2014-07-01 Manindra Agrawal , Rohit Gurjar , Arpita Korwar , Nitin Saxena

The multiview variety of an arrangement of cameras is the Zariski closure of the images of world points in the cameras. The prime vanishing ideal of this complex projective variety is called the multiview ideal. We show that the bifocal and…

Commutative Algebra · Mathematics 2019-11-06 Sameer Agarwal , Andrew Pryhuber , Rekha Thomas
‹ Prev 1 4 5 6 7 8 10 Next ›