Related papers: Canonical Frames for Bracket Generating Rank 2 Dis…
Graph cuts are among the most prominent tools for clustering and classification analysis. While intensively studied from geometric and algorithmic perspectives, graph cut-based statistical inference still remains elusive to a certain…
This work addresses one-shot set and graph generation, and, more specifically, the parametrization of probabilistic decoders that map a vector-shaped prior to a distribution over sets or graphs. Sets and graphs are most commonly generated…
We construct the general model with only parallel positive tension 3-branes on $M^4 \times R^1$ and $M^4 \times R^1/Z_2$. The cosmology constant is sectional constant along the fifth dimension. In this general scenario, the 5-dimensional…
For a graph G=(V,E), finding a set of disjoint edges that do not share any vertices is called a matching problem, and finding the maximum matching is a fundamental problem in the theory of distributed graph algorithms. Although local…
A set $S$ of vertices in a graph $G$ is a $2$-dominating set if every vertex of $G$ not in $S$ is adjacent to at least two vertices in $S$, and $S$ is a $2$-independent set if every vertex in $S$ is adjacent to at most one vertex of $S$.…
We develop a general approach to constructing a deformation that describes the mapping of any dynamical system with irreducible first-class constraints in the phase space into another dynamical system with first-class constraints. It is…
A homemorphism between domains in $\mathbb R^n$, $n\ge 2$ is quasiconformal, with its intricate analytic and geometric consequences, if the (pointwise) linear dilatation -- a purely metric quantity -- is uniformly bounded. Gehring proved…
In this paper the problem of the existence of regular nut graphs is addressed. A generalization of Fowler's Construction which is a local enlargement applied to a vertex in a graph is introduced to generate nut graphs of higher order. Let…
We say that a Riemannian manifold M has rank at least k if every geodesic in M admits at least k parallel Jacobi fields. The Rank Rigidity Theorem of Ballmann and Burns-Spatzier, later generalized by Eberlein-Heber, states that a complete,…
The dominating graph of a graph G is a graph whose vertices correspond to the dominating sets of G and two vertices are adjacent whenever their corresponding dominating sets differ in exactly one vertex. Studying properties of dominating…
If the universe is (or a slice of) $AdS_5$ space with 3-branes, the 5-dimensional GUT scale on each brane can be indetified as the 5-dimensional Planck scale, but, the 4-dimensional Planck scale is generated from the low 4-dimensional GUT…
If $\mu$ is a distribution over the $d$-dimensional Boolean cube $\{0,1\}^d$, our goal is to estimate its mean $p\in[0,1]^d$ based on $n$ iid draws from $\mu$. Specifically, we consider the empirical mean estimator $\hat p_n$ and study the…
Optimal quantization for mixed distributions has emerged as a compelling area of study. In this work, we have focused on a mixed distribution formed from two uniform distributions with partially overlapping supports. For this class of…
We consider the extremal family of graphs of order $2^n$ in which no two vertices have identical neighbourhoods, yet the adjacency matrix has rank only $n$ over the field of two elements. A previous result from algebraic geometry shows that…
Let $ \Gamma \subset \RR^s $ be a lattice obtained from a module in a totally real algebraic number field. Let $\cR(\btheta, \bN)$ be an error term in the lattice point problem for the parallelepiped $[-\theta_1 N_1,\theta_1 N_1] \times ...…
A finite set $P$ of points in the plane is $n$-universal with respect to a class $\mathcal{C}$ of planar graphs if every $n$-vertex graph in $\mathcal{C}$ admits a crossing-free straight-line drawing with vertices at points of $P$. For the…
Many conjectures and open problems in graph theory can either be reduced to cubic graphs or are directly stated for cubic graphs. Furthermore, it is known that for a lot of problems, a counterexample must be a snark, i.e. a bridgeless cubic…
Nurowski showed that any generic 2-plane field $D$ on a 5-manifold $M$ determines a natural conformal structure $c_D$ on $M$; these conformal structures are exactly those (on oriented $M$) whose normal conformal holonomy is contained in the…
We consider the systems of diffusion-orthogonal polynomials, defined in the work [1] of D. Bakry, S. Orevkov and M. Zani and (particularly) explain why these systems with boundary of maximal possible degree should always come from the…
A question of Bergman asks whether the adjoint of the generic square matrix over a field can be factored nontrivially as a product of square matrices. We show that such factorizations indeed exist over any coefficient ring when the matrix…