English
Related papers

Related papers: New Class of 4-Dim Kochen-Specker Sets

200 papers

In this paper, we give a class of reflection rigid Coxeter systems. Let $(W,S)$ be a Coxeter system. Suppose that (1) for each $s,t\in S$ such that $m(s,t)$ is odd, $\{s,t\}$ is a maximal spherical subset of $S$, (2) there does not exist a…

Group Theory · Mathematics 2007-05-23 Tetsuya Hosaka

We construct examples of isometric M-theory backgrounds which preserve a different amount of supersymmetry depending on the choice of spin structure. These examples are of the form AdS_4 x L, where L is a seven-dimensional lens space whose…

High Energy Physics - Theory · Physics 2009-11-11 José Figueroa-O'Farrill , Sunil Gadhia

Recently many new classes of integrable systems in n dimensions occurring in classical and quantum mechanics have been shown to admit a functionally independent set of 2n-1 symmetries polynomial in the canonical momenta, so that they are in…

Mathematical Physics · Physics 2010-08-19 Ernest G. Kalnins , Jonathan M. Kress , Willard Miller

We present a new method for multiclass thresholding of a histogram which is based on the nonparametric Kernel Density (KD) estimation, where the unknown parameters of the KD estimate are defined using the Expectation-Maximization (EM)…

Image and Video Processing · Electrical Eng. & Systems 2022-02-11 S. Korneev , J. Gilles , I. Battiato

This work aims to bridge the gap between Dunkl superintegrable systems and the coalgebra symmetry approach to superintegrability, and subsequently to recover known models and construct new ones. In particular, an infinite family of…

Mathematical Physics · Physics 2025-10-08 Francisco J. Herranz , Danilo Latini

Steiner systems are a fascinating topic of combinatorics. The most studied Steiner systems are $S(2, 3, v)$ (Steiner triple systems), $S(3, 4, v)$ (Steiner quadruple systems), and $S(2, 4, v)$. There are a few infinite families of Steiner…

Information Theory · Computer Science 2017-06-02 Cunsheng Ding

The class of 2d minimal model CFTs with higher spin AdS3 duals is extended to theories with large N=4 superconformal symmetry. We construct a higher spin theory based on the global D(2,1|alpha) superalgebra, and propose a large N family of…

High Energy Physics - Theory · Physics 2015-06-16 Matthias R. Gaberdiel , Rajesh Gopakumar

Yu and Oh [1] have given a state independent proof of the Kochen-Specker theorem in three dimensions using only 13 rays. The proof consists of showing that a non-contextual hidden variable theory necessarily leads to an inequality that is…

Quantum Physics · Physics 2015-05-30 Ingemar Bengtsson , Kate Blanchfield , Adan Cabello

15 exactly solvable inhomogeneous (spinless) fermion systems on one-dimensional lattices are constructed explicitly based on the discrete orthogonal polynomials of Askey scheme, e.g. the Krawtchouk, Hahn, Racah, Meixner, $q$-Racah…

Quantum Physics · Physics 2025-01-28 Ryu Sasaki

A quasiperiodic packing Q of interpenetrating copies of C, most of them only partially occupied, can be defined in terms of the strip projection method for any icosahedral cluster C. We show that in the case when the coordinates of the…

Mathematical Physics · Physics 2014-11-18 Nicolae Cotfas

A semiclassical theory of a quantum spin$-S$ model with competing ring and Heisenberg exchange terms on the triangular lattice is obtained. A mechanism for the generation of $Z_2$ vortices is exhibited. The vortices are shown to carry a…

Strongly Correlated Electrons · Physics 2007-05-23 Amulya V Madhav

The structure of on-shell and off-shell 2D, (4,4) supersymmetric scalar multiplets is investigated, in components and in superspace. We reach the surprising result that there exist eight {\underline {distinct}} on-shell versions and an even…

High Energy Physics - Theory · Physics 2009-10-28 S. James Gates , Sergei V. Ketov

Robot simulators are indispensable tools across many fields, and recent research has significantly improved their functionality by incorporating additional gradient information. However, existing differentiable robot simulators suffer from…

Robotics · Computer Science 2024-12-30 Xiaohan Ye , Xifeng Gao , Kui Wu , Zherong Pan , Taku Komura

The $k$-cut complex was recently introduced by Bayer et al. as a generalization of earlier work of Fr{\"o}berg (1990) and Eagon and Reiner (1998), and was shown to be shellable for several classes of graphs. In this article, we prove that…

Combinatorics · Mathematics 2026-02-06 Himanshu Chandrakar

Scientists, engineers, biologists, and technology specialists universally leverage image segmentation to extract shape ensembles containing many thousands of curves representing patterns in observations and measurements. These large curve…

Computer Vision and Pattern Recognition · Computer Science 2026-01-09 Zachary Grey , Nicholas Fisher , Andrew Glaws

We introduce a class of projected entangled pair states (PEPS) which is based on a group symmetry twisted by a 3-cocycle of the group. This twisted symmetry gives rise to a new standard form for PEPS from which we construct a family of…

Strongly Correlated Electrons · Physics 2014-10-28 Oliver Buerschaper

We examine noninvertible symmetry (NIS) in one-dimensional (1D) symmetry-protected topological (SPT) phases protected by dipolar and exponential-charge symmetries, which are two key examples of modulated SPT (MSPT). To set the stage, we…

Strongly Correlated Electrons · Physics 2025-10-29 Jintae Kim , Yizhi You , Jung Hoon Han

The algebra of invariants of d-tuples of n x n skew-symmetric matrices under the action of the orthogonal group by simultaneous conjugation is considered over an infinite field of characteristic different from two. For n=3 and d>0 a minimal…

Representation Theory · Mathematics 2012-07-24 A. A. Lopatin

The regular polyhedra have the highest order of 3D symmetries and are exceptionally at- tractive templates for (self)-assembly using minimal types of building blocks, from nano-cages and virus capsids to large scale constructions like glass…

Computational Geometry · Computer Science 2015-07-31 Muhibur Rasheed , Chandrajit Bajaj

A vertex subset of a graph is called a distance-$k$ independent set if the distance between any two of its distinct vertices is at least $k + 1$. For all $n,k \geq 1$, we determine the minimum possible number of inclusion-wise maximal…

Combinatorics · Mathematics 2026-05-01 Dmitrii Taletskii