English
Related papers

Related papers: Construction Methods for Gaussoids

200 papers

Recently, Babson and Steingrimsson (see [BS]) introduced generalized permutations patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We study generating functions for the number…

Combinatorics · Mathematics 2007-05-23 T. Mansour

Let $p$ be a prime number. Irreducible cyclic codes of length $p^2-1$ and dimension $2$ over the integers modulo $p^h$ are shown to have exactly two nonzero Hamming weights. The construction uses the Galois ring of characteristic $p^h$ and…

Information Theory · Computer Science 2019-11-19 Minjia Shi , Tor Helleseth , Patrick Sole

A multidimensional version of the results of Koml\'os, Major and Tusn\'ady for sums of independent random vectors with finite exponential moments is obtained in the particular case where the summands have smooth distributions which are…

Probability · Mathematics 2014-02-07 F. Götze , A. Yu. Zaitsev

We construct free monoids in a monoidal category with finite limits and countable colimits, in which tensoring on either side preserves reflexive coequalizers and colimits of countable chains.

Category Theory · Mathematics 2010-09-10 Stephen Lack

We consider the problem of estimating the parameters in a pairwise graphical model in which the distribution of each node, conditioned on the others, may have a different parametric form. In particular, we assume that each node's…

Methodology · Statistics 2014-08-05 Shizhe Chen , Daniela Witten , Ali Shojaie

We present a family of relatively simple and unified lower bounds on the capacity of the Gaussian channel under a set of pointwise additive input constraints. Specifically, the admissible channel input vectors $\bx = (x_1, \ldots, x_n)$…

Information Theory · Computer Science 2025-10-07 Neri Merhav , Shlomo Shamai

We study refined and motivic wall-crossing formulas in N=2 supersymmetric gauge theories with SU(2) gauge group and N_f < 4 matter hypermultiplets in the fundamental representation. Such gauge theories provide an excellent testing ground…

High Energy Physics - Theory · Physics 2011-01-04 Tudor Dimofte , Sergei Gukov , Yan Soibelman

Examples with bound information on the regression function and density abound in many real applications. We propose a novel approach for estimating such functions by incorporating the prior knowledge on the bounds. Specially, a Gaussian…

Methodology · Statistics 2018-10-30 Jize Zhang , Lizhen Lin

We give an exponential upper and a quadratic lower bound on the number of pairwise non-isotopic simple closed curves can be placed on a closed surface of genus g such that any two of the curves intersects at most once. Although the gap is…

Geometric Topology · Mathematics 2013-01-04 Justin Malestein , Igor Rivin , Louis Theran

The recently developed theory of extended generating functions of symplectic maps are combined with methods to prove invertibility via high-order Taylor model methods to obtain rigorous lower bounds for the domains of definition of…

Dynamical Systems · Mathematics 2025-04-29 B. Erdelyi , J. Hoefkens , M. Berz

The problem of which Gauss diagram can be realized by knots 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 the needed conditions for realizability of a Gauss…

Geometric Topology · Mathematics 2017-09-05 Andrey Grinblat , Viktor Lopatkin

This paper discusses the question of how to recognize whether an operad is E_n (ie. equivalent to the little n-cubes operad). A construction is given which produces many new examples of E_n operads. This construction is developed in the…

Algebraic Topology · Mathematics 2007-05-23 Z. Fiedorowicz

We construct $n$-node graphs on which any $O(n)$-size spanner has additive error at least $+\Omega(n^{3/17})$, improving on the previous best lower bound of $\Omega(n^{1/7})$ [Bodwin-Hoppenworth FOCS '22]. Our construction completes the…

Data Structures and Algorithms · Computer Science 2024-04-30 Greg Bodwin , Gary Hoppenworth , Virginia Vassilevska Williams , Nicole Wein , Zixuan Xu

Let $\beta:=\sigma_1\sigma_2^{-1}$ be a braid in $B_3$, where $B_3$ is the braid group on 3 strings and $\sigma_1, \sigma_2$ are the standard Artin generators. We use Gauss diagram formulas to show that for each natural number $n$ not…

Geometric Topology · Mathematics 2016-04-15 Michael Brandenbursky

Motivated by the construction of tractable robust estimators via convex relaxations, we present conditions on the sample size which guarantee an augmented notion of Restricted Eigenvalue-type condition for Gaussian designs. Such a notion is…

Statistics Theory · Mathematics 2018-12-04 Philip Thompson , Arnak S. Dalalyan

Two distinct systems of commutative complex numbers in n dimensions are described, of polar and planar types. Exponential forms of n-complex numbers are given in each case, which depend on geometric variables. Azimuthal angles, which are…

Operator Algebras · Mathematics 2007-05-23 Silviu Olariu

We construct a frame of complex Gaussians for the space of $L^2(\mathbb{R}^n)$ functions. When propagated along bicharacteristics for the wave equation, the frame can be used to build a parametrix with suitable error terms. When the…

Analysis of PDEs · Mathematics 2010-03-19 Alden Waters

We study the set of curvature functions which a given compact manifold with boundary can possess. First, we prove that the sign demanded by the Gauss-Bonnet Theorem is a necessary and sufficient condition for a given function to be the…

Differential Geometry · Mathematics 2024-09-04 Tiarlos Cruz , Almir Silva Santos , Feliciano Vitório

We give the first and lowest order examples of 3-regular 3-edge-colored graphs that demonstrate the non-factorization of tensor model invariants in the large N limit of Gaussian random tensors, as proven on general grounds in [Gurau R.,…

Mathematical Physics · Physics 2026-03-10 Jonathan Berthold , Hannes Keppler

Consider a stationary Poisson point process in $\mathbb{R}^d$ and connect any two points whenever their distance is less than or equal to a prescribed distance parameter. This construction gives rise to the well known random geometric…

Probability · Mathematics 2017-01-04 Jens Grygierek , Christoph Thaele