Related papers: Low-degree functions without non-essential argumen…
We introduce a $q$-deformation that generalises in a single framework previous works on classical and enriched $P$-partitions. In particular, we build a new family of power series with a parameter $q$ that interpolates between Gessel's…
In this paper, we explicitly derive unbiased estimators for various functions of the rate parameter of the exponential distribution in the absence of a location parameter, including powers of the rate parameter, the $q$th quantile, the…
We show that if a 1-hyperbolic structurally finite entire function of type $(p,q)$, $p\ge 1$, is linearizable at an irrationally indifferent fixed point, then its multiplier satisfies the Brjuno condition. We also prove the generalized…
We study the average number $\mathcal{A}(G)$ of colors in the non-equivalent colorings of a graph $G$. We show some general properties of this graph invariant and determine its value for some classes of graphs. We then conjecture several…
Computing the smallest number $q$ such that the vertices of a given graph can be properly $q$-colored is one of the oldest and most fundamental problems in combinatorial optimization. The $q$-Coloring problem has been studied intensively…
We introduce new bases for the Hopf algebra of quasisymmetric functions that refine the symmetric powersum basis. These bases are expanded in terms of quasisymmetric monomial functions by using fillings of matrices. We define the analog of…
There is a natural one-to-one correspondence between squarefree monomial ideals and finite simple hypergraphs via the cover ideal construction. Let H be a finite simple hypergraph, and let J = J(H) be its cover ideal in a polynomial ring R.…
We give a randomized algorithm that properly colors the vertices of a triangle-free graph G on n vertices using O(\Delta(G)/ log \Delta(G)) colors, where \Delta(G) is the maximum degree of G. The algorithm takes O(n\Delta2(G)log\Delta(G))…
We consider negabent Boolean functions that have Trace representation. We completely characterize quadratic negabent monomial functions. We show the relation between negabent functions and bent functions via a quadratic function. Using this…
Hartsfield and Ringel constructed orientable quadrangular embeddings of the complete graph $K_n$ for $n\equiv 5 \pmod 8$, and nonorientable ones for $n \ge 9$ and $n\equiv 1 \pmod 4$. These provide minimal quadrangulations of their…
We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…
Boolean functions with few-valued spectra have wide applications in cryptography, coding theory, sequence designs, etc. In this paper, we further study the parametric construction approach to obtain balanced Boolean functions using…
$H_q(n,d)$ is defined as the graph with vertex set ${\mathbb Z}_q^n$ and where two vertices are adjacent if their Hamming distance is at least $d$. The chromatic number of these graphs is presented for various sets of parameters $(q,n,d)$.…
The technique of quantum electrodynamics (QED) calculations of energy levels in the helium atom is reviewed. The calculations start with the solution of the Schr\"odinger equation and account for relativistic and QED effects by perturbation…
The logarithm function and the exponential function are, by nature, base dependent. Thus, in this paper I introduces an arbitrary base in the logarithm and exponential functions, both dependent on $q$, in order to have $\log_a(x;q)$ and…
Let $C$ be an affine plane curve. We consider additive functions $f: K\rightarrow K$ for which $f(x)f(y)=0$, whenever $(x,y)\in C$. We show that if $K=\mathbb{R}$ and $C$ is the hyperbola with defining equation $xy=1$, then there exist…
By recent work of \citet{DobrinenICM} and \citet{Balko7} we know that every finite $G$ in the Henson graph $\mathbb{H}_{n+1}$ (the universal ultrahomogeneous $(n+1)$-clique free graph) has exact finite big Ramsey degree $k({G,n})$. That is,…
A colouring of a graph is "nonrepetitive" if for every path of even order, the sequence of colours on the first half of the path is different from the sequence of colours on the second half. We show that planar graphs have nonrepetitive…
Denoting $P(G,q)$ as the chromatic polynomial for coloring an $n$-vertex graph $G$ with $q$ colors, and considering the limiting function $W(\{G\},q) = \lim_{n \to \infty}P(G,q)^{1/n}$, a fundamental question in graph theory is the…
We present an elementary construction of an uncountably chromatic graph without uncountable, infinitely connected subgraphs.