Related papers: Canonical Frames for Bracket Generating Rank 2 Dis…

Complementing the previous paper in the series, this paper classifies $|2|$-graded parabolic geometries, listing their important properties: the group $G_0$, the graded tangent bundle $gr(T)$ and its algebra\"ic bracket, the relevant…

We study the implementation of a universal quantum gate set via multiple-braiding within $SU(2)_k$ ($k > 2$, $k \neq 4$) anyon models. The multiple elementary braiding matrices (MEBMs) are derived from the $q$-deformed representation theory…

The first goal of the present paper is to study the class groups of the edge rings of complete multipartite graphs, denoted by $\Bbbk[K_{r_1,\ldots,r_n}]$, where $1 \leq r_1 \leq \cdots \leq r_n$. More concretely, we prove that the class…

We give a density condition for when, subject to a necessary parity condition, an eulerian graph or digraph may be cellularly embedded in an orientable surface so that it has exactly two faces, each bounded by an euler circuit, one of which…

Universality, encompassing critical exponents, scaling functions, and dimensionless quantities, is fundamental to phase transition theory. In finite systems, universal behaviors are also expected to emerge at the pseudocritical point.…

The $\gamma_2$-norm of Boolean matrices plays an important role in communication complexity and discrepancy theory. In this paper, we study combinatorial properties of this norm, and provide new applications, involving Zarankiewicz type…

With the aid of hypergraph transversals it is proved that $\gamma_t(Q_{n+1}) = 2\gamma(Q_n)$, where $\gamma_t(G)$ and $\gamma(G)$ denote the total domination number and the domination number of $G$, respectively, and $Q_n$ is the…

For any positive integer $n$, we show that there exists a real number field $k$ (resp. $k'$) of degree $2^n$ whose $2$-class group is isomorphic $\mathbb{Z}/2\mathbb{Z}\times \mathbb{Z}/2\mathbb{Z}$ such that the Galois group of the maximal…

Part I of this work [2] developed the exact diffusion algorithm to remove the bias that is characteristic of distributed solutions for deterministic optimization problems. The algorithm was shown to be applicable to a larger set of…

Generators of the algebra of first class functions in a system with second class constraints are found. It is shown that first class functions form algebras with respect to the Dirac bracket and pointwise multiplication.The subspace of…

We provide new examples of groups without rational cross-sections (also called regular normal forms), using connections with bounded generation and rational orders on groups. Specifically, our examples are extensions of infinite torsion…

Computation of Gauss's arithmetic-geometric mean involves iteration of a simple step, whose algebro-geometric interpretation is the construction of an elliptic curve isogenous to a given one, specifically one whose period is double the…

We consider the Erdos-Renyi random graph G(n,p) inside the critical window, where p = 1/n + lambda * n^{-4/3} for some lambda in R. We proved in a previous paper (arXiv:0903.4730) that considering the connected components of G(n,p) as a…

In this paper we consider a random graph on which topological restrictions are imposed, such as constraints on the total number of edges, wedges, and triangles. We work in the dense regime, in which the number of edges per vertex scales…

The distribution of degree $d$ points on curves is well understood, especially for low degrees. We refine this study to include information on the Galois group in the simplest interesting case: $d = 3$. For curves of genus at least 5, we…

Let $X_n(K)$ be a building of Coxeter type $X_n = A_n$ or $X_n = D_n$ defined over a given division ring $K$ (a field when $X_n = D_n$). For a non-connected set $J$ of nodes of the diagram $X_n$, let $\Gamma(K) = Gr_J(X_n(K))$ be the…

In a sequence of four papers, we prove the following results (via a unified approach) for all sufficiently large $n$: (i) [1-factorization conjecture] Suppose that $n$ is even and $D\geq 2\lceil n/4\rceil -1$. Then every $D$-regular graph…

Degree distribution, or equivalently called degree sequence, has been commonly used to be one of most significant measures for studying a large number of complex networks with which some well-known results have been obtained. By contrast,…

We give an efficient randomized algorithm to construct a box representation of any graph G on n vertices in $1.5 (\Delta + 2) \ln n$ dimensions, where $\Delta$ is the maximum degree of G. We also show that $\boxi(G) \le (\Delta + 2) \ln n$…

A famous theorem of D. Orlov describes the derived bounded category of coherent sheaves on projective hypersurfaces in terms of an algebraic construction called graded matrix factorizations. In this article, I implement a proposal of E.…