English
Related papers

Related papers: Partitioning the hypercube into smaller hypercubes

200 papers

We derive the dominant asymptotic form and the order of the correction terms of the finite-perimeter partition function of self-avoiding polygons on the square lattice, which are weighted according to their area A as q^A, in the inflated…

Statistical Mechanics · Physics 2009-10-31 Thomas Prellberg , Aleksander L. Owczarek

We pursue the question how integers can be ordered or partitioned according to their divisibility properties. Based on pseudometrics on $\mathbb{Z}$, we investigate induced preorders, associated equivalence relations, and quotient sets. The…

Number Theory · Mathematics 2026-04-16 Mario Ziller

Consider a problem where 4k given vectors need to be partitioned into k clusters of four vectors each. A cluster of four vectors is called a quad, and the cost of a quad is the sum of the component-wise maxima of the four vectors in the…

Data Structures and Algorithms · Computer Science 2018-07-06 Annette M. C. Ficker , Thomas Erlebach , Matus Mihalak , Frits C. R. Spieksma

Let $S=\{K_{1,3},K_3,P_4\}$ be the set of connected graphs of size 3. We study the problem of partitioning the edge set of a graph $G$ into graphs taken from any non-empty $S'\subseteq S$. The problem is known to be NP-complete for any…

Data Structures and Algorithms · Computer Science 2022-08-29 Laurent Bulteau , Guillaume Fertin , Anthony Labarre , Romeo Rizzi , Irena Rusu

We study nested partitions of $R^d$ obtained by successive cuts using hyperplanes with fixed directions. We establish the number of measures that can be split evenly simultaneously by taking a partition of this kind and then distributing…

Metric Geometry · Mathematics 2014-10-14 Roman Karasev , Edgardo Roldán-Pensado , Pablo Soberón

In the Matching Cut problem we ask whether a graph $G$ has a matching cut, that is, a matching which is also an edge cut of $G$. We consider the variants Perfect Matching Cut and Disconnected Perfect Matching where we ask whether there…

Combinatorics · Mathematics 2025-01-16 Felicia Lucke

Given a partition $h_1+h_2+\dots+h_k = n$, a latin square of order $n$ with pairwise disjoint subsquares of orders $h_1,\dots ,h_k$ is called a realization. When the values $h_i$ are of at most two sizes, the existence of a realization has…

Combinatorics · Mathematics 2026-03-26 Tara Kemp , James G. Lefevre

We present a novel framework for studying combinatorial identities through the geometric lens of subset distributions in q-valued cubes. By analyzing how elements of arbitrary subsets are distributed among the faces of the cube E_q^n, we…

Discrete Mathematics · Computer Science 2025-07-02 Jamolidin K. Abdurakhmanov

We compute some numerical invariants of the lines on hyperplane sections of a smooth cubic threefold over complex numbers. We also prove that for any smooth hypersurface $X\subset \mathbb P^{n+1}$ of degree $d$ over an algebraically closed…

Algebraic Geometry · Mathematics 2020-07-08 Yiran Cheng

We consider the realization space of the $d$-dimensional cube, and show that any two realizations are connected by a finite sequence of projective transformations and normal transformations. We use this fact to define an analog of the…

Combinatorics · Mathematics 2019-12-23 Karim Adiprasito , Daniel Kalmanovich , Eran Nevo

We investigate the set of partial partitions of a finite set, ordered by inclusion. With this ordering the set of partial partitions can be studied as an abstract simplicial complex. We use the theory of shellable nonpure complexes to find…

Combinatorics · Mathematics 2023-11-21 Michael J. Gottstein

We prove that for $d>1$ the best information ratio of the perfect secret sharing scheme based on the edge set of the $d$-dimensional cube is exactly $d/2$. Using the technique developed, we also prove that the information ratio of the…

Cryptography and Security · Computer Science 2013-10-18 Laszlo Csirmaz

For every $d\geq 2$, we construct a subset $D\subseteq \{1,2,\dots,n\}^d$ of size $n-o(n)$ such that every affine hyperplane of $\mathbb{R}^d$ intersects $D$ in at most $d$ points, and every hypersphere of $\mathbb{R}^n$ intersects $D$ in…

Combinatorics · Mathematics 2025-11-06 Dávid R. Szabó

The partitioning of space by hyperplanes in the context of discrete classification problem is considered. We obtain some relations for the number of partitions and establish a recurrence relation for the maximal number of partitions of R^n…

Discrete Mathematics · Computer Science 2013-12-17 Armen Bagdasaryan

We settle the existence of certain "anti-magic" cubes using combinatorial block designs and graph decompositions to align a handful of small examples.

Combinatorics · Mathematics 2021-06-24 Peter Dukes , Joanna Niezen

For any natural number $d$ and positive number $\varepsilon$, we present a point set in the $d$-dimensional unit cube $[0,1]^d$ that intersects every axis-aligned box of volume greater than $\varepsilon$. These point sets are very easy to…

Computational Geometry · Computer Science 2017-09-12 David Krieg

Given a random k-dimensional cross-section of a hypercube, what is its expected number of vertices? We show that, for a suitable distribution of random slices, the answer is $2^k$, independent of the dimension of the hypercube.

Probability · Mathematics 2018-08-30 Hunter Swan

Let $p_{\textrm{dsd}} (n)$ be the number of partitions of $n$ into distinct squarefree divisors of $n$. In this note, we find a lower bound for $p_{\textrm{dsd}} (n)$, as well as a sequence of $n$ for which $p_{\textrm{dsd}} (n)$ is…

Number Theory · Mathematics 2024-02-14 Noah Lebowitz-Lockard , Joseph Vandehey

We study the existence of cubic quotients of finite-dimensional quasi-normed spaces, that is, quotients well isomorphic to $\ell_{\infty}^k$ for some $k.$ We give two results of this nature. The first guarantees a proportional dimensional…

Functional Analysis · Mathematics 2007-05-23 N. J. Kalton , A. E. Litvak

We characterize pairs (Q,d) consisting of a quiver Q and a dimension vector d, such that over a given algebraically closed field k there are infinitely many representations of Q of dimension vector d. We also present an application of this…

Representation Theory · Mathematics 2019-03-13 Grzegorz Bobinski
‹ Prev 1 3 4 5 6 7 10 Next ›