On perfect 2-colorings of the q-ary n-cube

A coloring of a $q$-ary $n$-dimensional cube (hypercube) is called perfect if, for every $n$-tuple $x$, the collection of the colors of the neighbors of $x$ depends only on the color of $x$. A Boolean-valued function is called correlation-immune of degree $n?m$ if it takes value $1$ the same number of times for each $m$-dimensional face of the hypercube. Let $f={\chi }^S$ be a characteristic function of a subset $S$ of hypercube. In the present paper we prove the inequality $\rho \left(S\right)q(\mathrm{cor}\left(f\right)+1)\le \alpha \left(S\right)$, where $\mathrm{cor}\left(f\right)$ is the maximum degree of the correlation immunity of $f$, $\alpha \left(S\right)$ is the average number of neighbors in the set $S$ for $n$-tuples in the complement of a set $S$, and $\rho \left(S\right)=\left|S\right|/q^n$ is the density of the set $S$. Moreover, the function $f$ is a perfect coloring if and only if we have an equality in the formula above. Also, we find a new lower bound for the cardinality of components of a perfect coloring and a 1-perfect code in the case $q>2$.     

Solving bivariate systems using Rational Univariate Representations

Given two coprime polynomials $P$ and $Q$ in $\mathbb{Z}[x,y]$ of degree bounded by $d$ and bitsize bounded by $\tau$, we address the problem of solving the system $\{P,Q\}$. We are interested in certified numerical approximations or, more precisely, isolating boxes of the solutions. We are also interested in computing, as intermediate symbolic objects, rational parameterizations of the solutions, and in particular Rational Univariate Representations (RURs), which can easily turn many queries on the system into queries on univariate polynomials. Such representations require the computation of a separating form for the system, that is a linear combination of the variables that takes different values when evaluated at the distinct solutions of the system.We present new algorithms for computing linear separating forms, RUR decompositions and isolating boxes of the solutions. We show that these three algorithms have worst-case bit complexity ${\tilde{O}}_B(d^6+d^5\tau )$, where $\tilde{O}$ refers to the complexity where polylogarithmic factors are omitted and $O_B$ refers to the bit complexity. We also present probabilistic Las Vegas variants of our two first algorithms, which have expected bit complexity ${\tilde{O}}_B(d^5+d^4\tau )$. A key ingredient of our proofs of complexity is an amortized analysis of the triangular decomposition algorithm via subresultants, which is of independent interest.     

Rainbow number of matchings in planar graphs

The rainbow number$rb(G,H)$ for the graph $H$ in $G$ is defined to be the minimum integer $c$ such that any $c$-edge-coloring of $G$ contains a rainbow $H$. As one of the most important structures in graphs, the rainbow number of matchings has drawn much attention and has been extensively studied. Jendrol et al. initiated the rainbow number of matchings in planar graphs and they obtained bounds for the rainbow number of the matching $k{K}_2$ in the plane triangulations, where the gap between the lower and upper bounds is $O\left(k^3\right)$. In this paper, we show that the rainbow number of the matching $k{K}_2$ in maximal outerplanar graphs of order $n$ is $n+O\left(k\right)$. Using this technique, we show that the rainbow number of the matching $k{K}_2$ in some subfamilies of plane triangulations of order $n$ is $2n+O\left(k\right)$. The gaps between our lower and upper bounds are only $O\left(k\right)$.     

Markov processes conditioned on their location at large exponential times

Suppose that ${\left(X_t\right)}_{t\ge 0}$ is a one-dimensional Brownian motion with negative drift $?\mu$. It is possible to make sense of conditioning this process to be in the state 0 at an independent exponential random time and if we kill the conditioned process at the exponential time the resulting process is Markov. If we let the rate parameter of the random time go to 0, then the limit of the killed Markov process evolves like $X$ conditioned to hit 0, after which time it behaves as $X$ killed at the last time $X$ visits 0. Equivalently, the limit process has the dynamics of the killed “bang–bang” Brownian motion that evolves like Brownian motion with positive drift $+\mu$ when it is negative, like Brownian motion with negative drift $?\mu$ when it is positive, and is killed according to the local time spent at 0.An extension of this result holds in great generality for a Borel right process conditioned to be in some state $a$ at an exponential random time, at which time it is killed. Our proofs involve understanding the Campbell measures associated with local times, the use of excursion theory, and the development of a suitable analogue of the “bang–bang” construction for a general Markov process.As examples, we consider the special case when the transient Borel right process is a one-dimensional diffusion. Characterizing the limiting conditioned and killed process via its infinitesimal generator leads to an investigation of the $h$-transforms of transient one-dimensional diffusion processes that goes beyond what is known and is of independent interest.     

The 1:1 resonance in Hamiltonian systems

Two-degree-of-freedom Hamiltonian systems with an elliptic equilibrium at the origin are characterised by the frequencies of the linearisation. Considering the frequencies as parameters, the system undergoes a bifurcation when the frequencies pass through a resonance. These bifurcations are well understood for most resonances $k:l$, but not the semisimple cases $1:1$ and $1:?1$. A two-degree-of-freedom Hamiltonian system can be approximated to any order by an integrable normal form. The reason is that the normal form of a Hamiltonian system has an additional integral due to the normal form symmetry. The latter is intimately related to the ratio of the frequencies. For a rational frequency ratio this leads to $S^1$-symmetric systems. The question we wish to address is about the co-dimension of such a system in $1:1$ resonance with respect to left-right-equivalence, where the right action is $S^1$-equivariant. The result is a co-dimension five unfolding of the central singularity. Two of the unfolding parameters are moduli and the remaining non-modal parameters are the ones found in the linear unfolding of this system.     

Asymptotic expansion for vector-valued sequences of random variables with focus on Wiener chaos

We develop the asymptotic expansion theory for vector-valued sequences ${\left(F_N\right)}_{N\ge 1}$ of random variables in terms of the convergence of the Stein–Malliavin matrix associated with the sequence $F_N$. Our approach combines the classical Fourier approach and the recent Stein–Malliavin theory. We find the second order term of the asymptotic expansion of the density of $F_N$ and we illustrate our results by several examples.     

An Edgeworth expansion for functionals of Gaussian fields and its applications

This paper is concerned with the rate of convergence in the normal approximation of the sequence $\left\{F_n\right\}$, where each $F_n$ is a functional of an infinite-dimensional Gaussian field. We develop new and powerful techniques for computing the exact rate of convergence in distribution with respect to the Kolmogorov distance. As a tool for our works, the Edgeworth expansion of general orders, with an explicitly expressed remainder, will be obtained, and this remainder term will be controlled to find upper and lower bounds of the Kolmogorov distance in the case of an arbitrary sequence $\left\{F_n\right\}$. As applications, we provide the optimal fourth moment theorem of the sequence $\left\{F_n\right\}$ in the case when $\left\{F_n\right\}$ is a sequence of random variables living in a fixed Wiener chaos or a finite sum of Wiener chaoses. In the former case, our results show that the conditions given in this paper seem more natural and minimal than ones appeared in the previous works.     

Improved Bohr’s inequality for locally univalent harmonic mappings

We prove several improved versions of Bohr’s inequality for the harmonic mappings of the form $f=h+\overline{g}$, where $h$ is bounded by 1 and $\left|g^{\prime }\left(z\right)\right|\le \left|h^{\prime }\left(z\right)\right|$. The improvements are obtained along the lines of an earlier work of Kayumov and Ponnusamy, i.e. (Kayumov and Ponnusamy, 2018) for example a term related to the area of the image of the disk $D(0,r)$ under the mapping $f$ is considered. Our results are sharp. In addition, further improvements of the main results for certain special classes of harmonic mappings are provided.     

Signed graphs and the freeness of the Weyl subarrangements of type Bℓ

A Weyl arrangement is the hyperplane arrangement defined by a root system. Saito proved that every Weyl arrangement is free. The Weyl subarrangements of type $A_{\ell }$ are represented by simple graphs. Stanley gave a characterization of freeness for this type of arrangements in terms of their graph. In addition, the Weyl subarrangements of type $B_{\ell }$ can be represented by signed graphs. A characterization of freeness for them is not known. However, characterizations of freeness for a few restricted classes are known. For instance, Edelman and Reiner characterized the freeness of the arrangements between type $A_{\ell -1}$ and type $B_{\ell }$. In this paper, we give a characterization of the freeness and supersolvability of the Weyl subarrangements of type $B_{\ell }$ under certain assumption.     

Tensors,matchings and codes

We exploit the structure of the critical orbital sets of symmetry classes of tensors associated to sign uniform partitions and we establish new connections between symmetry classes of tensors, matchings on bipartite graphs and coding theory. In particular, we prove that the orthogonal dimension of the critical orbital sets associated to single hook partitions $\lambda =(w\text{,}{1}^{n-w})$ equals the value of the coding theoretic function $A(n\text{,}4\text{,}w)$. When $w=2$ we reobtain this number as the independence number of the Dynkin diagram $A_{n-1}$.     

Spin actions in Euclidean and Hermitian Clifford analysis in superspace

In [4] we studied the group invariance of the inner product of supervectors as introduced in the framework of Clifford analysis in superspace. The fundamental group ${\mathrm{SO}}_0$ leaving invariant such an inner product turns out to be an extension of $\text{SO}(m)\times \text{Sp}(2n)$ and gives rise to the definition of the spin group in superspace through the exponential of the so-called extended superbivectors, where the spin group can be seen as a double covering of ${\mathrm{SO}}_0$ by means of the representation $h(s)[x]=sx\stackrel{￣}{s}$. In the present paper, we study the invariance of the Dirac operator in superspace under the classical H and L actions of the spin group on superfunctions. In addition, we consider the Hermitian Clifford setting in superspace, where we study the group invariance of the Hermitian inner product of supervectors introduced in [3]. The group of complex supermatrices leaving this inner product invariant constitutes an extension of $\text{U}(m)\times \text{U}(n)$ and is isomorphic to the subset ${\text{SO}}_0^J$ of ${\text{SO}}_0$ of elements that commute with the complex structure J. The realization of ${\text{SO}}_0^J$ within the spin group is studied together with the invariance under its actions of the super Hermitian Dirac system. It is interesting to note that the spin element leading to the complex structure can be expressed in terms of the n-dimensional Fourier transform.     

Equivalences among Z2s-linear Hadamard codes

The ${\mathbb{Z}}_{2^s}$-additive codes are subgroups of ${\mathbb{Z}}_{2^s}^n$, and can be seen as a generalization of linear codes over ${\mathbb{Z}}_2$ and ${\mathbb{Z}}_4$. A ${\mathbb{Z}}_{2^s}$-linear Hadamard code is a binary Hadamard code which is the Gray map image of a ${\mathbb{Z}}_{2^s}$-additive code. A partial classification of these codes by using the dimension of the kernel is known. In this paper, we establish that some ${\mathbb{Z}}_{2^s}$-linear Hadamard codes of length $2^t$ are equivalent, once $t$ is fixed. This allows us to improve the known upper bounds for the number of such nonequivalent codes. Moreover, up to $t=11$, this new upper bound coincides with a known lower bound (based on the rank and dimension of the kernel). Finally, when we focus on $s\in \{2,3\}$, the full classification of the ${\mathbb{Z}}_{2^s}$-linear Hadamard codes of length $2^t$ is established by giving the exact number of such codes.