English
Related papers

Related papers: How close can we come to a parity function when th…

200 papers

Using the theory of group action, we first introduce the concept of the automorphism group of an exponential family or a graphical model, thus formalizing the general notion of symmetry of a probabilistic model. This automorphism group…

Artificial Intelligence · Computer Science 2012-07-24 Hung Hai Bui , Tuyen N. Huynh , Sebastian Riedel

We consider self-similar statistical ensembles with the phase space whose volume is invariant under the deformation that squeezes (expands) the coordinate and expands (squeezes) the momentum. Related probability distribution function is…

Statistical Mechanics · Physics 2009-11-13 A. I. Olemskoi , A. S. Vaylenko , I. A. Shuda

It is known that the normalized algorithmic information distance $N$ is not computable and not semicomputable. We show that for all $\epsilon < 1/2$, there exist no semicomputable functions that differ from $N$ by at most~$\epsilon$.…

Information Theory · Computer Science 2020-02-18 Bruno Bauwens , Ilya Blinnikov

We consider the question of the existence of homomorphisms between $G_{n,p}$ and odd cycles when $p=c/n,\,1<c\leq 4$. We show that for any positive integer $\ell$, there exists $\epsilon=\epsilon(\ell)$ such that if $c=1+\epsilon$ then…

Combinatorics · Mathematics 2014-04-22 Alan Frieze , Wesley Pegden

In this paper we prove results regarding Boolean functions with small spectral norm (the spectral norm of f is $\|\hat{f}\|_1=\sum_{\alpha}|\hat{f}(\alpha)|$). Specifically, we prove the following results for functions $f:\{0,1\}^n \to…

Computational Complexity · Computer Science 2013-05-23 Amir Shpilka , Avishay Tal , Ben lee Volk

If eps > 0 and p >= n^{-1/2 + eps}, in a binomial random graph G(n,p) a.a.s. the set of cycles which can be constructed as a symmetric difference of Hamilton circuits is as large as parity by itself permits (all cycles if n is odd, all even…

Combinatorics · Mathematics 2013-08-05 Peter C. Heinig

We prove for an arbitrary one-dimensional random walk with independent increments that the probability of crossing a level at a given time n has the order of square root of n. Moment or symmetry assumptions are not necessary. In removing…

Probability · Mathematics 2007-05-23 Rainer Siegmund-Schultze , Heinrich von Weizsaecker

Let $V$ be a finite-dimensional vector space over $\mathbb{F}_p$. We say that a multilinear form $\alpha \colon V^k \to \mathbb{F}_p$ in $k$ variables is $d$-approximately symmetric if the partition rank of difference $\alpha(x_1, \dots,…

Combinatorics · Mathematics 2021-12-30 Luka Milićević

For integers $g,m \geq 0$ and $n>0$, let $S_{g}(n,m)$ denote the graph taken uniformly at random from the set of all graphs on $\{1,2, \ldots, n\}$ with exactly $m=m(n)$ edges and with genus at most $g$. We use counting arguments to…

Combinatorics · Mathematics 2017-12-18 Chris Dowden , Mihyun Kang , Philipp Sprüssel

We derive limiting distributions of symmetrized estimators of scatter, where instead of all $n(n-1)/2$ pairs of the $n$ observations we only consider $nd$ suitably chosen pairs, $1 \le d < \lfloor n/2\rfloor$. It turns out that the…

Statistics Theory · Mathematics 2023-08-21 Lutz Duembgen , Klaus Nordhausen

Let $w:[0,1]^2\rightarrow [0,1]$ be a symmetric function, and consider the random process $G(n,w)$, where vertices are chosen from $[0,1]$ uniformly at random, and $w$ governs the edge formation probability. Such a random graph is said to…

Combinatorics · Mathematics 2016-09-15 Huda Chuangpishit , Mahya Ghandehari , Jeannette Janssen

We consider random Cayley digraphs of order $n$ with uniformly distributed generating set of size $k$. Specifically, we are interested in the asymptotics of the probability such a Cayley digraph has diameter two as $n\to\infty$ and…

Combinatorics · Mathematics 2007-06-26 Primož Potočnik , Jozef Širáň , Jana Šiagiová , Manuel E. Lladser , Mark C. Wilson

We investigate the realizations of a random Gaussian field on a finite domain of ${\mathbb R}^d$ in the limit where a given linear functional of the field is large. We prove that if its variance is bounded, the field converges uniformly and…

Probability · Mathematics 2019-02-07 Philippe Mounaix

Let $\Gamma$ be a finitely generated group equipped with a symmetric and nondegenerate probability measure $\mu$ with finite second moment, and $Y$ a CAT(0) space which is either proper or of finite telescopic dimension. We show that if an…

Group Theory · Mathematics 2023-05-01 Hiroyasu Izeki

We study the parity of coefficients of classical mock theta functions. Suppose $g$ is a formal power series with integer coefficients, and let $c(g;n)$ be the coefficient of $q^n$ in its series expansion. We say that $g$ is of parity type…

Number Theory · Mathematics 2021-06-07 Liuquan Wang

Suppose that all groups of order $n$ are defined on the same set $G$ of cardinality $n$, and let the \emph{distance} of two groups of order $n$ be the number of pairs $(a,b)\in G\times G$ where the two group operations differ. Given a group…

Group Theory · Mathematics 2015-09-21 Petr Vojtěchovský , Ian M. Wanless

We show that there is always a uniformly antisymmetric f:A-> {0,1} if A subset R is countable. We prove that the continuum hypothesis is equivalent to the statement that there is an f:R-> omega with |S_x| <= 1 for every x in R. If the…

Logic · Mathematics 2016-09-06 Peter Komjath , Saharon Shelah

Suppose that $f$ is a homomorphism from the mapping class group $\mathcal{M}(N_{g,n})$ of a nonorientable surface of genus $g$ with $n$ boundary components, to $\mathrm{GL}(m,\mathbb{C})$. We prove that if $g\ge 5$, $n\le 1$ and $m\le g-2$,…

Geometric Topology · Mathematics 2014-11-11 Blazej Szepietowski

We study the phenomenon of intransitivity in models of dice and voting. First, we follow a recent thread of research for $n$-sided dice with pairwise ordering induced by the probability, relative to $1/2$, that a throw from one die is…

Probability · Mathematics 2020-10-27 Jan Hązła , Elchanan Mossel , Nathan Ross , Guangqu Zheng

Several well-known open questions (such as: are all groups sofic/hyperlinear?) have a common form: can all groups be approximated by asymptotic homomorphisms into the symmetric groups $\mathrm{Sym}(n)$ (in the sofic case) or the finite…

Group Theory · Mathematics 2018-02-16 Marcus De Chiffre , Lev Glebsky , Alex Lubotzky , Andreas Thom