相关论文: Sunflowers and Testing Triangle-Freeness of Functi…

For $S \subseteq \{0,1\}^n$ a Boolean function $f \colon S \to \{-1,1\}$ is a polynomial threshold function (PTF) of degree $d$ and weight $W$ if there is a polynomial $p$ with integer coefficients of degree $d$ and with sum of absolute…

Let F be a class of functions with the uniqueness property: if a function f in F vanishes on a set of positive measure, then f is the zero function. In many instances, we would like to have a quantitative version of this property, e.g. a…

A Boolean $k$-monotone function defined over a finite poset domain ${\cal D}$ alternates between the values $0$ and $1$ at most $k$ times on any ascending chain in ${\cal D}$. Therefore, $k$-monotone functions are natural generalizations of…

A natural measure of smoothness of a Boolean function is its sensitivity (the largest number of Hamming neighbors of a point which differ from it in function value). The structure of smooth or equivalently low-sensitivity functions is still…

We show that if the second eigenvalue $\lambda$ of a $d$-regular graph $G$ on $n \in 3 \mathbb{Z}$ vertices is at most $\varepsilon d^2/(n \log n)$, for a small constant $\varepsilon > 0$, then $G$ contains a triangle-factor. The bound on…

A Boolean function $f:\{0,1\}^n\to \{0,1\}$ is $k$-linear if it returns the sum (over the binary field $F_2$) of $k$ coordinates of the input. In this paper, we study property testing of the classes $k$-Linear, the class of all $k$-linear…

For a given rational number $x$ and an integer $s\geq 1$, let us consider a generalized polylogarithmic function, often called the Lerch function, defined by $$\Phi_{s}(x,z)= \sum_{k=0}^{\infty}\frac{z^{k+1}}{(k+x+1)^s}\enspace.$$ We prove…

Let V be a smooth projective 3-fold of general type. Denote by $K^3$, a rational number, the self-intersection of the canonical sheaf of any minimal model of V. One defines $K^3$ as the canonical volume of $V$. Assume $p_g\ge 2$. We show…

This paper resolves an open problem posed by Schweizer and Sklar in 1983. We establish that the binary operation $\tauTL$ is a triangle function on $\Delp$ if and only if the following three conditions hold: (a) $L$ is a continuous t-conorm…

A triangle-free (simple) 2-matching is an edge set that has at most $2$ edges incident to each vertex and contains no cycle of length $3$. For the problem of finding a maximum cardinality triangle-free 2-matching in a given graph, a…

We study the Stochastic Boolean Function Certification (SBFC) problem, where we are given $n$ Bernoulli random variables $\{X_e: e \in U\}$ on a ground set $U$ of $n$ elements with joint distribution $p$, a Boolean function $f: 2^U \to \{0,…

For a prime power $q$, $\F$ denotes the finite field of order $q$, and for $m\geq 2$, $\Fm$ denotes the extension field of degree $m$. We establish a characteristic function for the set of $(r,\, n)$-free elements of finite cyclic…

Given two $k$-uniform hypergraphs $F$ and $G$, we say that $G$ has an $F$-covering if every vertex in $G$ is contained in a copy of $F$. For $1\le i \le k-1$, let $c_i(n,F)$ be the least integer such that every $n$-vertex $k$-uniform…

For a closed orientable connected 3-manifold $M$, its complexity $\boldsymbol{T}(M)$ is defined to be the minimal number of tetrahedra in its triangulations. Under the assumption that $M$ is prime (but not necessarily atoroidal), we…

Quantum algorithms for optimization problems are of general interest. Despite recent progress in classical lower bounds for nonconvex optimization under different settings and quantum lower bounds for convex optimization, quantum lower…

A triangle in a hypergraph is a collection of distinct vertices u,v,w and distinct edges e,f,g with u,v \in e, v,w \in f, w,u \in g, and \{u,v,w\} \cap e \cap f \cap g=\emptyset. The i-degree of a vertex in a hypergraph is the number of…

An $\alpha$-thin tree $T$ of a graph $G$ is a spanning tree such that every cut of $G$ has at most an $\alpha$ proportion of its edges in $T$. The Thin Tree Conjecture proposes that there exists a function $f$ such that for any $\alpha >…

Let G be an undirected simple graph having n vertices and let f be a function defined to be f:V(G) -> {0,..., n-1}. An f-factor of G is a spanning subgraph H such that degree of a vertex v in H is f(v) for every vertex v in V(G). The…

We consider the problem of Clifford testing, which asks whether a black-box $n$-qubit unitary is a Clifford unitary or at least $\varepsilon$-far from every Clifford unitary. We give the first 4-query Clifford tester, which decides this…

In 1995 Stanley conjectured that the chromatic symmetric functions of the graphs $P_{d,2}$, which we call triangular ladders, were $e$-positive. In this paper we confirm this conjecture, which is also an unsolved case of the celebrated…