Related papers: Construction Methods for Gaussoids
We extend the twisted gauge theory model of topological orders in three spatial dimensions to the case where the three spaces have two dimensional boundaries. We achieve this by systematically constructing the boundary Hamiltonians that are…
In this paper, we prove restriction estimates for hyperbolic paraboloids in dimensions $n>=5$ by the polynomial partitioning method.
Gaussian Graphical Models (GGM) are often used to describe the conditional correlations between the components of a random vector. In this article, we compare two families of GGM inference methods: nodewise edge selection and penalised…
Stringent restrictions for model building are imposed by a no-go theorem in noncommutative gauge field theory. Circumventing this theorem is crucial for the construction of realistic models of particle interactions. To this end, the…
We show how three-dimensional superconformal theories for any number N <= 8 of supersymmetries can be obtained by taking a conformal limit of the corresponding three-dimensional gauged supergravity models. The superconformal theories are…
In this paper we construct new Griesmer codes of dimension $k\geq 5$ by means of some geometric methods such as projective dual and geometric puncturing.
By employing the residue polynomials, a construction of constant-composition codes is given. This construction generalizes the one proposed by Xing[16]. It turns out that when d=3 this construction gives a lower bound of…
A variational method is discussed, extending the Gaussian effective potential to higher orders. The single variational parameter is replaced by trial unknown two-point functions, with infinite variational parameters to be optimized by the…
We develop a method to construct elusive functions using techniques of commutative algebra and algebraic geometry. The key notions of this method are elusive subsets and evaluation mappings. We also develop the effective elimination theory…
We use probabilistic methods to find lower bounds on the maximum number, in a graph with domination number \gamma, of dominating sets of size \gamma. We find that we can randomly generate a graph that, w.h.p., is dominated by almost all…
Galilean conformal algebras can be constructed by contracting a finite number of conformal algebras, and enjoy truncated $\mathbb{Z}$-graded structures. Here, we present a generalisation of the Galilean contraction procedure, giving rise to…
Cyclic codes with a few weights are very useful in the design of frequency hopping sequences and the development of secret sharing schemes. In this paper, we mainly use Gauss sums to represent the Hamming weights of a general construction…
The purpose of this short communication is to make some observations on the connections between various existing formulas of counting the number of sublattices of a fixed index in an $n$-dimensional lattice and their connection with the…
The powers of generating functions and its properties are analyzed. A new class of functions is introduced, based on the application of compositions of an integer $n$, called composita. The methods for obtaining reciprocal and reverse…
As Gaussian processes are used to answer increasingly complex questions, analytic solutions become scarcer and scarcer. Monte Carlo methods act as a convenient bridge for connecting intractable mathematical expressions with actionable…
In this paper, we give a construction of strongly regular Cayley graphs on the additive groups of finite fields based on three-valued Gauss periods. As consequences, we obtain two infinite families and one sporadic example of new strongly…
We establish Gaussian limits for general measures induced by binomial and Poisson point processes in d-dimensional space. The limiting Gaussian field has a covariance functional which depends on the density of the point process. The general…
Combinatorial $t$-designs have nice applications in coding theory, finite geometries and several engineering areas. There are two major methods of constructing $t$-designs. One of them is via group actions of certain permutation groups…
Tensors are often compressed by expressing them in low rank tensor formats. In this paper, we develop three methodologies that bound the compressibility of a tensor: (1) Algebraic structure, (2) Smoothness, and (3) Displacement structure.…
Gel'fand triples of test and generalized functionals in Gaussian spaces are constructed and characterized.