Related papers: Construction Methods for Gaussoids
Counting number fields with prescribed Galois group is an enduring challenge in arithmetic statistics. Using the determinant method, we provide an upper bound for even groups, which is new in some cases.
We provide several examples of higher gauge theories, constructed as generalizations of a BF model to 2BF and 3BF models with constraints. Using the framework of higher category theory, we introduce appropriate 2-groups and 3-groups, and…
We study the height and width of a Galton--Watson tree with offspring distribution B satisfying E(B)=1, 0 < Var(B) < infinity, conditioned on having exactly n nodes. Under this conditioning, we derive sub-Gaussian tail bounds for both the…
Highly oscillatory integrals of composite type arise in electronic engineering and their calculations is a challenging problem. In this paper, we propose two Gaussian quadrature rules for computing such integrals. The first one is…
In this paper we prove the necessity of the main sufficient condition of Meinardus for sub exponential rate of growth of the number of structures, having multiplicative generating functions of a general form and establish a new necessary…
In this paper we study a certain class of polycyclic groups. We outline a method for constructing a poly-$\mathbb{Z}$ group $G_n$ by describing a process for selecting maps that are used to extend $G_i$ to $G_{i+1}$ for $1 \leq i \leq n-1$…
We prove two mixed versions of the Discrete Nodal Theorem of Davies et. al. [3] for bounded degree graphs, and for three-connected graphs of fixed genus $g$. Using this we can show that for a three-connected graph satisfying a certain…
We establish an alternative, ``perpendicular" collection of generating functions for the coefficients of Gaussian polynomials, $\begin{bmatrix}N+m\\m\end{bmatrix}_q$. We provide a general characterization of these perpendicular generating…
We consider the construction of a polygon $P$ with $n$ vertices whose turning angles at the vertices are given by a sequence $A=(\alpha_0,\ldots, \alpha_{n-1})$, $\alpha_i\in (-\pi,\pi)$, for $i\in\{0,\ldots, n-1\}$. The problem of…
The present article derives the minimal number $N$ of observations needed to consider a Bayesian posterior distribution as Gaussian. Two examples are presented. Within one of them, a chi-squared distribution, the observable $x$ as well as…
We review the construction of Lagrangians for higher spin fields of mixed symmetry in the framework of graded geometry. The main advantage of the graded formalism in this context is that it provides universal expressions, in the sense that…
This note informally describes a way to build certain cubical n-categories by iterating a process of taking models of certain finite limits theories. We base this discussion on a construction of "double bicategories" as bicategories…
Double polycirculant codes are introduced here as a generalization of double circulant codes. When the matrix of the polyshift is a companion matrix of a trinomial, we show that such a code is isodual, hence formally self-dual. Numerical…
The cross-ratio degree problem counts configurations of n points on P^1 with n-3 prescribed cross-ratios. Cross-ratio degrees arise in many corners of combinatorics and geometry, but their structure is not well-understood in general.…
We study several-matrix models and show that when the potential is convex and a small perturbation of the Gaussian potential, the first order correction to the free energy can be expressed as a generating function for the enumeration of…
We construct a sequence of compact, oriented, embedded, two-dimensional surfaces of genus one into Euclidean 3-space with prescribed, almost constant, mean curvature of the form $H(X)=1+{A}{|X|^{-\gamma}}$ for $|X|$ large, when $A<0$ and…
We extend the linearised solution of Polchinski and Strassler describing the supergravity dual of the N=1* gauge theory. By analysing the equations of motion of type IIB supergravity at cubic order in the mass perturbation parameter, we…
We show that a transitively reduced digraph has a confluent upward drawing if and only if its reachability relation has order dimension at most two. In this case, we construct a confluent upward drawing with $O(n^2)$ features, in an $O(n)…
$n$-cycle permutations with small $n$ have the advantage that their compositional inverses are efficient in terms of implementation. They can be also used in constructing Bent functions and designing codes. Since the AGW Criterion was…
Four circulant codes form a special class of $2$-generator, index $4$, quasi-cyclic codes. Under some conditions on their generator matrices they can be shown to be self-dual. Artin primitive root conjecture shows the existence of an…