English
Related papers

Related papers: Higher dimensional floorplans and Baxter d-permuta…

200 papers

The colourful simplicial depth problem in dimension d is to find a configuration of (d+1) sets of (d+1) points such that the origin is contained in the convex hull of each set (colour) but contained in a minimal number of colourful…

Combinatorics · Mathematics 2012-10-30 Antoine Deza , Tamon Stephen , Feng Xie

Recent works have demonstrated reasonable success of representation learning in hypercomplex space. Specifically, "fully-connected layers with Quaternions" (4D hypercomplex numbers), which replace real-valued matrix multiplications in…

Machine Learning · Computer Science 2021-02-18 Aston Zhang , Yi Tay , Shuai Zhang , Alvin Chan , Anh Tuan Luu , Siu Cheung Hui , Jie Fu

This work shows the existence of a d>2 dimensional covariant "Beltrami vielbein" that generalizes the d=2 situation. Its definition relies on a sub-foliation \Sigma^{ADM}_{d-1}=\Sigma_{d-3}\times\Sigma_2 of the Arnowit--Deser--Misner leaves…

High Energy Physics - Theory · Physics 2021-12-10 Laurent Baulieu

A (convex) polytope $P$ is said to be $2$-level if for every direction of hyperplanes which is facet-defining for $P$, the vertices of $P$ can be covered with two hyperplanes of that direction. The study of these polytopes is motivated by…

The Cayley-Dickson Construction is a generalization of the familiar construction of the complex numbers from pairs of real numbers. The complex numbers can be viewed as two-dimensional vectors equipped with a multiplication. The…

Logic in Computer Science · Computer Science 2017-05-22 John Cowles , Ruben Gamboa

A stacking operation adds a $d$-simplex on top of a facet of a simplicial $d$-polytope while maintaining the convexity of the polytope. A stacked $d$-polytope is a polytope that is obtained from a $d$-simplex and a series of stacking…

Computational Geometry · Computer Science 2017-03-03 Erik D. Demaine , Andre Schulz

We study the question of whether a sequence d = (d_1,d_2, \ldots, d_n) of positive integers is the degree sequence of some outerplanar (a.k.a. 1-page book embeddable) graph G. If so, G is an outerplanar realization of d and d is an…

Data Structures and Algorithms · Computer Science 2024-05-07 Amotz Bar-Noy , Toni Bohnlein , David Peleg , Yingli Ran , Dror Rawitz

This paper begins by extending the notion of a combinatorial configuration of points and lines to a combinatorial configuration of points and planes that we refer to as configurations of order $2$. We then proceed to investigate a further…

Combinatorics · Mathematics 2022-12-13 Benjamin Peet

We construct the tensor hierarchies of generic, bosonic, 5- and 6-dimensional field theories. The construction of the tensor hierarchy starts with the introduction of two tensors: the embedding tensor which tells us which vector is used for…

High Energy Physics - Theory · Physics 2009-09-28 Jelle Hartong , Tomás Ortín

We introduce the set of (non-spanning) tree-decorated planar maps, and show that they are in bijection with the Cartesian product between the set of trees and the set of maps with a simple boundary. As a consequence, we count the number of…

Combinatorics · Mathematics 2020-04-09 Luis Fredes , Avelio Sepúlveda

We construct a direct natural bijection between descending plane partitions without any special part and permutations. The directness is in the sense that the bijection avoids any reference to nonintersecting lattice paths. The advantage of…

Combinatorics · Mathematics 2020-06-16 Arvind Ayyer

Fracture paths in quasi-two-dimenisonal (2D) media (e.g thin layers of materials, paper) are analyzed as self-affine graphs $h(x)$ of height $h$ as a function of length $x$. We show that these are multiscaling, in the sense that $n^{th}$…

Materials Science · Physics 2015-06-25 Eran Bouchbinder , Itamar Procaccia , Stephane Santucci , Loic Vanel

Looking at the cartesian product of a topological space with itself, a natural map to be considered on that object is the involution that interchanges the coordinates, i.e. that maps (x,y) to (y,x). The so-called halfsquaring construction,…

Algebraic Topology · Mathematics 2010-02-09 Denise Nakiboglu

This paper introduces a new way of generalizing Hilbert's two-dimensional space-filling curve to arbitrary dimensions. The new curves, called harmonious Hilbert curves, have the unique property that for any d' < d, the d-dimensional curve…

Computational Geometry · Computer Science 2012-11-02 Herman Haverkort

Let A be an n by d matrix having full rank n. An orthogonal dual A^{\perp} of A is a (d-n) by d matrix of rank (d-n) such that every row of A^{\perp} is orthogonal (under the usual dot product) to every row of A. We define the orthogonal…

Combinatorics · Mathematics 2012-01-31 Joseph P. S. Kung , Hal Schenck

We investigate the generalization of the Costas property in 3 or more dimensions, and we seek an appropriate definition; the 2 main complications are a) that the number of ``dots'' this multidimensional structure should have is not obvious,…

Combinatorics · Mathematics 2007-05-23 Konstantinos Drakakis

We construct a birational map of $\mathbb{P}^d$ ($d\geq6$) whose intermediate dynamical degrees are all trancendental.

Algebraic Geometry · Mathematics 2025-03-04 Yutaro Sugimoto

We extend Schaeffer's bijection between rooted quadrangulations and well-labeled trees to the general case of Eulerian planar maps with prescribed face valences, to obtain a bijection with a new class of labeled trees, which we call…

Combinatorics · Mathematics 2007-05-23 J. Bouttier , P. Di Francesco , E. Guitter

Roughly speaking, a space with varying dimension consists of at least two components with different dimensions. In this paper we will concentrate on the one, which can be treated as $\mathbb{R}^3$ tying a half line not contained by…

Probability · Mathematics 2020-08-18 Liping Li , Shuwen Lou

We consider a new kind of straight and shifted plane partitions/Young tableaux --- ones whose diagrams are no longer of partition shape, but rather Young diagrams with boxes erased from their upper right ends. We find formulas for the…

Combinatorics · Mathematics 2012-05-31 Greta Panova