Related papers: Construction Methods for Gaussoids
We present constructions and bounds for additive codes over a finite field in terms of their geometric counterpart, i.e., projective systems. It is known that the maximum number of $(h-1)$-spaces in PG$(2,q)$, such that no hyperplane…
The theory of composite mixtures consisting of $n$ constituents is framed within the schema provided by the notion of $n$-groupoid. The point of departure is the analysis of $n$-dimensional hypercubes and their skeletons, to each of whose…
Let $S$ be a regular set of $\R^d$ and $X : S\rightarrow \R$ be Gaussian field with regular paths. In order to give bound to the tail of the distribution of the maximum, we use the record method of Mercadier. We present some new form in…
Many statistical models are algebraic in that they are defined by polynomial constraints or by parameterizations that are polynomial or rational maps. This opens the door for tools from computational algebraic geometry. These tools can be…
We obtain a new bound on the second moment of modified shifted convolutions of the generalized 3-fold divisor function, and show that, for applications, the modified version is sufficient.
This article provides a method for constructing invariants and semi-invariants of a binary $N$-ic form over a field $k$ characteristics $0$ or $p > N$. A practical and broadly applicable sufficient condition for ensuring nontriviality of…
We propose a dictionary between geometry of triangulated 3-manifolds and physics of three-dimensional N=2 gauge theories. Under this duality, standard operations on triangulated 3-manifolds and various invariants thereof (classical as well…
Applying Baaz's Generalization Method and a new technique to, respectively, proofs and denumerable simple graphs, diverse arithmetical patterns are observed. In particular, sufficient conditions for a number to be a divisor of a Fermat…
We prove a uniform generalized gaussian bound for the powers of a discrete convolution operator in one space dimension. Our bound is derived under the assumption that the Fourier transform of the coefficients of the convolution operator is…
Models with dimension more than the available sample size are now commonly used in various applications. A sensible inference is possible using a lower-dimensional structure. In regression problems with a large number of predictors, the…
Cyclic codes are an interesting type of linear codes and have applications in communication and storage systems due to their efficient encoding and decoding algorithms. They have been studied for decades and a lot of progress has been made.…
We give lower bounds for the degree of multiplicative combinations of iterates of rational functions (with certain exceptions) over a general field, establishing the multiplicative independence of said iterates. This leads to a…
Motivated by the need to control the exponential growth of constraint violations in numerical solutions of the Einstein evolution equations, two methods are studied here for controlling this growth in general hyperbolic evolution systems.…
Restriction is a natural quasi-order on $d$-way tensors. We establish a remarkable aspect of this quasi-order in the case of tensors over a fixed finite field -- namely, that it is a well-quasi-order: it admits no infinite antichains and no…
Gaussian pentachoron weights can be used for constructing algebraic realizations of four-dimensional Pachner moves. Here, we consider a natural `gauge equivalence' for such weights with one and two bosonic - i.e., commuting - variables on…
We give constructions of some special cases of $[n,k]$ Reed-Solomon codes over finite fields of size at least $n$ and $n+1$ whose generator matrices have constrained support. Furthermore, we consider a generalisation of the GM-MDS…
A (smooth) embedding of a closed curve on the plane with finitely many intersections is said to be generic if each point of self-intersection is crossed exactly twice and at non-tangent angles. A finite word $\omega$ where each character…
We prove polynomial upper bounds of geometric Ramsey numbers of pathwidth-2 outerplanar triangulations in both convex and general cases. We also prove that the geometric Ramsey numbers of the ladder graph on $2n$ vertices are bounded by…
Our main result is that every n-dimensional polytope can be described by at most (2n-1) polynomial inequalities and, moreover, these polynomials can explicitly be constructed. For an n-dimensional pointed polyhedral cone we prove the bound…
In this review articel we study the gaugings of extended supergravity theories in various space-time dimensions. These theories describe the low-energy limit of non-trivial string compactifications. For each theory under consideration we…