Related papers: Construction Methods for Gaussoids
We prove a structure theorem for multiplicative functions on the Gaussian integers, showing that every bounded multiplicative function on the Gaussian integers can be decomposed into a term which is approximately periodic and another which…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
We give an efficient construction of a reasonably small dominating set in a circulant graph on $n$ notes and $k$ distinct chord lengths. This result is based on bounds on some double exponential sums. .
We identify a class of continuous compactly supported functions for which the known part of the Gabor frame set can be extended. At least for functions with support on an interval of length two, the curve determining the set touches the…
We present methods of constructing examples of quandles of order 3n, where n is greater or equal to 3. The necessary and sufficient conditions for the constructed examples to be (i) connected (ii) group (conjugate) (iii) involutory and (iv)…
Various superpositions of Bessel-Gaussian beams and modified Bessel Gaussian beams are considered. Two selected parameters characterizing these beams, with respect to which the superpositions are constructed, are the topological index $n$…
We present three methods to construct majorizing measures in various settings. These methods are based on direct constructions of increasing sequences of partitions through a simple exhaustion procedure rather than on the construction of…
In this work we count the number of satisfying states of triangulations of a convex n-gon using the transfer matrix method. We show an exponential (in n) lower bound. We also give the exact formula for the number of satisfying states of a…
The processes of constructing some graphs from others using binary operations of union with intersection (gluing) are studied. For graph classes closed with respect to gluing operations the elemental and operational bases are introduced.…
We construct generating functions for operators dual to systems of giant gravitons with open strings attached. These operators have a bare dimension of order $N$ so that the usual methods used to solve the planar limit are not applicable.…
We prove that the number of combinatorially distinct causal 3-dimensional triangulations homeomorphic to the 3-dimensional sphere is bounded by an exponential function of the number of tetrahedra. It is also proven that the number of…
There are known constructions for some regular polygons, usually inscribed in a circle, but not for all polygons - the Gauss-Wantzel Theorem states precisely which ones can be constructed. The constructions differ greatly from one polygon…
We explore how matrix bootstrap techniques can be used to constrain matrix and tensor models at finite $N$, where $N$ is the dimension of the matrix/tensor, taking a Gaussian model with a quartic interaction as example. For matrix models,…
A Gauss diagram is a simple, combinatorial way to present a link. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting subdiagrams of certain combinatorial types. In this paper we…
The Hamiltonian description for a wide class of mechanical systems, having local symmetry transformations depending on time derivatives of the gauge parameters of arbitrary order, is constructed. The Poisson brackets of the Hamiltonian and…
Let $G$ be a connected undirected graph on $n$ vertices with no loops but possibly multiedges. Given an arithmetical structure $(\textbf{r}, \textbf{d})$ on $G$, we describe a construction which associates to it a graph $G'$ on $n-1$…
The problem of which Gauss diagram can be realized by plane curves is an old one and has been solved in several ways. In this paper, we present a direct approach to this problem. We show that needed conditions for realizability of a Gauss…
We study the regularity of densities of distributions that are polynomial images of the standard Gaussian measure on $\mathbb{R}^n$. We assume that the degree of a polynomial is fixed and that each variable enters to a power bounded by…
MDS self-dual codes have good algebraic structure, and their parameters are completely determined by the code length. In recent years, the construction of MDS Euclidean self-dual codes with new lengths has become an important issue in…
A recent result in [2] on the non-existence of Gauss-Lobatto cubature rules on the triangle is strengthened by establishing a lower bound for the number of nodes of such rules. A method of constructing Lobatto type cubature rules on the…