Related papers: Boolean constant degree functions on the slice are…
In 1982, Cameron and Liebler investigated certain "special sets of lines" in PG(3,q), and gave several equivalent characterizations. Due to their interesting geometric and algebraic properties, these "Cameron-Liebler line classes" got much…
Let f(n,m) be the maximum of the sum of the squares of degrees of a graph with n vertices and m edges. Summarizing earlier research, we present a concise, asymptotically sharp upper bound on f(n,m), better than the bound of de Caen for…
In the present investigation, we consider two new subclasses N_{{\Sigma}}^{{\mu}}({\alpha},{\lambda}) and N_{{\Sigma}}^{{\mu}}({\beta},{\lambda}) of bi-univalent functions defined in the open unit disk U={z:|z|<1}. Besides, we find upper…
We derive several identities for the Hurwitz and Riemann zeta functions, the Gamma function, and Dirichlet $L$-functions. They involve a sequence of polynomials $\alpha_k(s)$ whose study was initiated in an earlier paper. The expansions…
This paper describes new results on the growth and zeros of the Ruelle zeta function for the Julia set of a hyperbolic rational map. It is shown that the zeta function is bounded by $\exp(C_K |s|^{\delta})$ in strips $|\Re s| \leq K$, where…
$k$th-order sum-free functions are a natural generalization of APN functions using the concept of (non)vanishing flats. In this paper, we introduce a new combinatorial technique to study the nonvanishing flats of Boolean functions. This…
We study the query complexity on slices of Boolean functions. Among other results we show that there exists a Boolean function for which we need to query all but 7 input bits to compute its value, even if we know beforehand that the number…
Given any $\varepsilon>0$, we construct an orthonormal system of $n_k$ uniformly bounded polynomials of degree at most $k$ on the unit sphere in $\mathbb R^{m+1}$ where $n_k$ is bigger than $1-\varepsilon$ times the dimension of the space…
Consider a $3$-uniform hypergraph of order $n$ with clique number $k$ such that the intersection of all its $k$-cliques is empty. Szemer\'edi and Petruska proved $n\leq 8m^2+3m$, for fixed $m=n-k$, and they conjectured the sharp bound…
We study the slices or sections of a convex polytope by affine hyperplanes. We present results on two key problems: First, we provide tight bounds on the maximum number of vertices attainable by a hyperplane slice of $d$-polytope (a sort of…
The sum $S(h,k):=\sum_{j=1}^{k-1}(-1)^{j+1+[hj/k]}$ appears in the modular transformation formulae of the classical theta function $\vartheta_3(z)$. The double sum $S(k) := \sum_{h=1}^{k-1}S(h,k)$ has a remarkable distribution of values.…
Given a partition l and a composition b, the stretched Kostka coefficient K_{l, b}(n) is the map sending each positive integer n to the Kostka coefficient indexed by nl and nb. Kirillov and Reshetikhin (1986) have shown that stretched…
We consider polynomials of the form t^n-1 and determine when members of this family have a divisor of every degree in Z[t]. With F(x) defined to be the number of such integers up to x, we prove the existence of two positive constants c_1…
The paper contains two main results that are obtained by Boolean valued analysis. The first asserts that a universally complete vector lattice without locally one-dimensional bands can be decomposed into a direct sum of two vector…
Rubalcaba and Slater (Robert R. Rubalcaba and Peter J. Slater. Efficient (j,k)-domination. Discuss. Math. Graph Theory, 27(3):409-423, 2007.) define a $(j,k)$-dominating function on graph $X$ as a function $f:V(X)\rightarrow \{0,\ldots,j\}$…
We prove a sharp upper bound for the number of high degree differences in bipartite graphs: let $ (U, V, E)$ be a bipartite graph with $U=\{u_1, u_2, \dots, u_n\}$ and $V=\{v_1, v_2, \dots, v_n\}$; for $n\ge k>\frac{n}{2}$ we show that…
A Boolean function $f:V \to \{-1,1\}$ on the vertex set of a graph $G=(V,E)$ is locally $p$-stable if for every vertex $v$ the proportion of neighbours $w$ of $v$ with $f(v)=f(w)$ is exactly $p$. This notion was introduced by Gross and…
Multi-degree splines are smooth piecewise-polynomial functions where the pieces can have different degrees. We describe a simple algorithmic construction of a set of basis functions for the space of multi-degree splines, with similar…
Consider a graph $G$ and a real-valued function $f$ defined on the degree set of $G$. The sum of the outputs $f(d_v)$ over all vertices $v\in V(G)$ of $G$ is usually known as the vertex-degree-function indices and is denoted by $H_f(G)$,…
When $k<n$, we study the coherent systems that come from a BGN extension in which the quotient bundle is strictly semistable. In this case we describe a stratification of the moduli space of coherent systems. We also describe the strata as…