English
Related papers

Related papers: Hypercube orientations with only two in-degrees

200 papers

The $d$-dimensional hypercube graph $Q_d$ has as vertices all subsets of $\{1,\ldots,d\}$, and an edge between any two sets that differ in a single element. The Ruskey-Savage conjecture asserts that every matching of $Q_d$, $d\ge 2$, can be…

Combinatorics · Mathematics 2025-04-17 Jiří Fink , Torsten Mütze

Given two elements of a vector space acted on by a reductive group, we ask whether they lie in the same orbit, and if not, whether one lies in the orbit closure of the other. We develop techniques to optimize the orbit and orbit closure…

Algebraic Geometry · Mathematics 2020-06-23 Eunice Sukarto

In $\mathcal L$, the semilattice of faces of an $n$-cube, we count the number of automorphisms of $\mathcal L$ that fix a given subalgebra -- either pointwise or as a subalgebra. By using M\"obius inversion we get a formula for the number…

Combinatorics · Mathematics 2009-02-06 Colin Bailey , Joseph Oliveira

Twisted hypercubes are generalizations of the Boolean hypercube, obtained by iteratively connecting two instances of a graph by a uniformly random perfect matching. Dudek et al. showed that when the two instances are independent, these…

Combinatorics · Mathematics 2023-05-08 Itai Benjamini , Yotam Dikstein , Renan Gross , Maksim Zhukovskii

We provide a formula for the number of edges of the Hasse diagram of the independent subsets of the h-th power of a path ordered by inclusion. For h=1 such a value is the number of edges of a Fibonacci cube. We show that, in general, the…

Discrete Mathematics · Computer Science 2014-01-22 Pietro Codara , Ottavio M. D'Antona

In the first part of this work we provide a formula for the number of edges of the Hasse diagram of the independent subsets of the h-th power of a path ordered by inclusion. For h=1 such a value is the number of edges of a Fibonacci cube.…

Discrete Mathematics · Computer Science 2012-10-23 Pietro Codara , Ottavio M. D'Antona

For any forest $G = (V, E)$ it is possible to orient the edges $E$ so that no vertex in $V$ has out-degree greater than $1$. This paper considers the incremental edge-orientation problem, in which the edges $E$ arrive over time and the…

Data Structures and Algorithms · Computer Science 2021-07-07 Michael A. Bender , Tsvi Kopelowitz , William Kuszmaul , Ely Porat , Clifford Stein

We show that every 3-uniform hypergraph with $n$ vertices and minimum vertex degree at least $(5/9+o(1))\binom{n}2$ contains a tight Hamiltonian cycle. Known lower bound constructions show that this degree condition is asymptotically…

Combinatorics · Mathematics 2019-06-13 Christian Reiher , Vojtěch Rödl , Andrzej Ruciński , Mathias Schacht , Endre Szemerédi

The $n$-dimensional binary hypercube is the graph whose vertices are the binary $n$-tuples $\{0, 1\}^n$ and where two vertices are connected by an edge if they differ at exactly one coordinate. We prove that if the edges are assigned…

Probability · Mathematics 2014-06-06 Anders Martinsson

We study theoretically a double quantum dot hydrogen molecule in the GaAs conduction band as the basic elementary gate for a quantum computer with the electron spins in the dots serving as qubits. Such a two-dot system provides the…

Quantum Physics · Physics 2009-10-31 Xuedong Hu , S. Das Sarma

We show that the number of double points of smoothly immersed 2-spheres representing certain homology classes of an oriented, smooth, closed, simply-connected 4-manifold X must increase with the complexity of corresponding h-cobordisms from…

Geometric Topology · Mathematics 2021-01-06 Hannah R. Schwartz

The T-graph of a multigraded Hilbert scheme records the zero and one-dimensional orbits of the T = (K^*)^n action on the Hilbert scheme induced from the T-action on A^n. It has vertices the T-fixed points, and edges the one-dimensional…

Algebraic Geometry · Mathematics 2011-10-11 Milena Hering , Diane Maclagan

We construct two complete invariants of oriented classical knots in space. The value of each invariant on any knot is a set, infinite for the first invariant and finite for the second. The finite set is computed algorithmically from any…

Geometric Topology · Mathematics 2023-06-02 Dimitrios Kodokostas

The article completes the research of two-point G$^2$ Hermite interpolation problem with spirals by inversion of conics. A simple algorithm is proposed to construct a family of 4th degree rational spirals, matching given G$^2$ Hermite data.…

Differential Geometry · Mathematics 2019-10-15 Alexey Kurnosenko

In order to have a compact visualization of the order type of a given point set S, we are interested in geometric graphs on S with few edges that unambiguously display the order type of S. We introduce the concept of exit edges, which…

The $n$-cube graph is the graph on the vertex set of $n$-tuples of $0$s and $1$s, with two vertices joined by an edge if and only if the $n$-tuples differ in exactly one component. We compute the Smith group of this graph, or, equivalently,…

Combinatorics · Mathematics 2020-01-30 David Chandler , Peter Sin , Qing Xiang

By a tight tour in a $k$-uniform hypergraph $H$ we mean any sequence of its vertices $(w_0,w_1,\ldots,w_{s-1})$ such that for all $i=0,\ldots,s-1$ the set $e_i=\{w_i,w_{i+1}\ldots,w_{i+k-1}\}$ is an edge of $H$ (where operations on indices…

Computational Complexity · Computer Science 2023-06-22 Zbigniew Lonc , Paweł Naroski , Paweł Rzążewski

Seiberg-Witten theory is used to obtain new obstructions to the existence of Einstein metrics on 4-manifolds with conical singularities along an embedded surface. In the present article, the cone angle is required to be of the form 2(pi)/p,…

Differential Geometry · Mathematics 2013-05-10 Claude LeBrun

We consider inhomogeneous non-oriented Bernoulli bond percolation on $\mathbb{Z}^d$, where each edge has a parameter depending on its direction. We prove that, under certain conditions, if the sum of the parameters is strictly greater than…

Probability · Mathematics 2025-01-03 Pablo A. Gomes , Alan Pereira , Remy Sanchis

We enumerate all spaces obtained by gluing in pairs the faces of the octahedron in an orientation-reversing fashion. Whenever such a gluing gives rise to non-manifold points, we remove small open neighbourhoods of these points, so we…

Geometric Topology · Mathematics 2007-09-11 Damian Heard , Ekaterina Pervova , Carlo Petronio