English
Related papers

Related papers: Generalizations of Sch\"{o}bi's Tetrahedral Dissec…

200 papers

The $n$-slice algebra is introduced as a generalization of path algebra in higher dimensional representation theory. In this paper, we give a classification of $n$-slice algebras via their $(n+1)$-preprojective algebras and the trivial…

Representation Theory · Mathematics 2020-10-08 Jin Yun Guo , Cong Xiao , Xiaojian Lu

Dissections of polytopes are a well-studied subject by geometers as well as recreational mathematicians. A recent application in coding theory arises from the problem of parameterizing binary vectors of constant Hamming weight which has…

Information Theory · Computer Science 2015-06-15 Antonio Campello , Vinay A. Vaishampayan

Cuntz algebras $\mathcal{O}_n$, $n>1$, are celebrated examples of a separable infinite simple C*-algebra with a number of fascinating properties. Their K-theory allows an embedding of $\mathcal O_m$ in $\mathcal O_n$ whenever $n-1$ divides…

Operator Algebras · Mathematics 2025-02-21 Piotr M. Hajac , Yang Liu

A (semi)brick over an algebra $A$ is a module $S$ such that the endomorphism ring $\operatorname{\mathsf{End}}_A(S)$ is a (product of) division algebra. For each Dynkin diagram $\Delta$, there is a bijection from the Coxeter group $W$ of…

Representation Theory · Mathematics 2018-06-13 Sota Asai

This paper proposes a new method which builds a simplex based approximation of a $d-1$-dimensional manifold $M$ separating a $d$-dimensional compact set into two parts, and an efficient algorithm classifying points according to this…

Computational Geometry · Computer Science 2018-07-18 Guillaume Deffuant

An $N$-dimensional parallelepiped will be called a bar if and only if there are no more than $k$ different numbers among the lengths of its sides (the definition of bar depends on $k$). We prove that a parallelepiped can be dissected into…

Combinatorics · Mathematics 2008-09-12 Ivan Feshchenko , Danylo Radchenko , Lev Radzivilovsky , Maksym Tantsiura

For 0 < x < 1, take the binary expansion with infinitely many 0's, replace each 0 with -1, this gives the polarized binary expansion of x. Let R_i(x) be the ith "polarized bit" and let S_n(x) be the sum of the first n R_i(x). {S_n} is the…

Probability · Mathematics 2019-11-13 Vladimir Dobric , Marina Skyers , Lee J. Stanley

The machinery of zonotopal algebra is linked with two particular polytopes: the Stanley-Pitman polytope and the regular simplex $\mathfrak{Sim}_n(t_1,...,t_n)$ with parameters $t_1,...,t_n\in \mathbb{R}_+^n$, defined by the inequalities…

Combinatorics · Mathematics 2018-10-11 Sarah B. Brodsky

We show that for the regular n-simplex, the 1-codimensional central slice that's parallel to a facet will achieve the minimum area (up to a 1-o(1) factor) among all 1-codimensional central slices, thus improving the previous best known…

Metric Geometry · Mathematics 2024-06-24 Colin Tang

Given $n$ pairwise openly disjoint triangles in 3-space, their vertical depth relation may contain cycles. We show that, for any $\varepsilon>0$, the triangles can be cut into $O(n^{3/2+\varepsilon})$ connected semi-algebraic pieces, whose…

Computational Geometry · Computer Science 2019-03-08 Boris Aronov , Edward Y. Miller , Micha Sharir

Let $W$ be a Weyl group corresponding to the root system $A_{n-1}$ or $B_n$. We define a simplicial complex $ \Delta^m_W $ in terms of polygon dissections for such a group and any positive integer $m$. For $ m=1 $, $ \Delta^m_W$ is…

Combinatorics · Mathematics 2007-05-23 Eleni Tzanaki

We begin by introducing schemes of binoids, invertible $\mathcal{O}_M$-sets and cohomology of sheaves of abelian groups defined on schemes of binoids. We define the so-called punctured combinatorial \v{C}ech-Picard complex, whose first…

Commutative Algebra · Mathematics 2016-11-09 Davide Alberelli

The well know theorem of Tverberg states that if n > (d+1)(r-1) then one can partition any set of n points in R^d to r disjoint subsets whose convex hulls have a common point. The numbers T(d,r) = (d + 1)(r - 1) + 1 are known as Tverberg…

Combinatorics · Mathematics 2014-09-11 Micha A. Perles , Moriah Sigron

While it is a classical result dating back to Dehn (1903) that squares composing a perfect rectangle must have rational side lengths, the arithmetic complexity of these tilings, specifically the growth of the denominators of these rational…

Combinatorics · Mathematics 2026-05-05 Paul Perrier

We use the measurable Hall's theorem due to Cie\'sla and Sabok to prove that (i) if two measurable sets $A,B \subset \mathbb{R}^d$ of the same measure are bounded remainder sets with respect to a given irrational $d$-dimensional vector…

Metric Geometry · Mathematics 2026-02-13 Mark Mordechai Etkind , Sigrid Grepstad , Mihail N. Kolountzakis , Nir Lev

We continue the study of separable elements in finite Weyl groups. These elements generalize the well-studied class of separable permutations. We show that the multiplication map $W/U \times U \to W$ is a length-additive bijection, or…

Combinatorics · Mathematics 2020-11-03 Christian Gaetz , Yibo Gao

For $q$ generic, Jimbo showed that $q$-tensor space $V_q^{\otimes r}$ (where $V_q$ is the $n$-dimensional vector representation) satisfies Schur--Weyl duality with respect to the commuting actions of the quantized enveloping algebra…

Quantum Algebra · Mathematics 2026-03-24 Stephen Doty , Anthony Giaquinto , Stuart Martin

A theorem of Tverberg from 1966 asserts that every set $X\subset\mathbb{R}^d$ of $n=T(d,r)=(d+1)(r-1)+1$ points can be partitioned into $r$ pairwise disjoint subsets, whose convex hulls have a point in common. Thus every such partition…

Combinatorics · Mathematics 2017-05-17 Moshe White

The classical Erd\H{o}s-Littlewood-Offord theorem says that for nonzero vectors $a_1,\dots,a_n\in \mathbb{R}^d$, any $x\in \mathbb{R}^d$, and uniformly random $(\xi_1,\dots,\xi_n)\in\{-1,1\}^n$, we have…

Combinatorics · Mathematics 2022-06-16 Jacob Fox , Matthew Kwan , Hunter Spink

A hinged dissection of a set of polygons S is a collection of polygonal pieces hinged together at vertices that can be folded into any member of S. We present a hinged dissection of all edge-to-edge gluings of n congruent copies of a…

Computational Geometry · Computer Science 2007-05-23 Erik D. Demaine , Martin L. Demaine , David Eppstein , Greg N. Frederickson , Erich Friedman
‹ Prev 1 2 3 10 Next ›