Related papers: Representing polynomial of ST-CONNECTIVITY
A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. We deal with the connectivity of the graphs of cubical polytopes. We first establish that, for any $d\ge 3$, the graph of a cubical $d$-polytope…
Exhibiting an explicit Boolean function with a large high-order nonlinearity is an important problem in cryptography, coding theory, and computational complexity. We prove lower bounds on the second-order, third-order, and higher-order…
Let $p$ be a multilinear polynomial in several non-commuting variables with coefficients in a quadratically closed field $K$ of any characteristic. It has been conjectured that for any $n$, the image of $p$ evaluated on the set $M_n(K)$ of…
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We compare several different possible definitions. Our main…
We obtain a family of polynomials defined by vanishing conditions and associated to tangles. We study more specifically the case where they are related to a O(n) loop model. We conjecture that their specializations at $z_i=1$ are {\it…
Among all states on the algebra of non-commutative polynomials, we characterize the ones that have monic orthogonal polynomials. The characterizations involve recursion relations, Hankel-type determinants, and a representation as a joint…
Quantum invariants like the colored Jones polynomial are algebraic in nature but are conjectured to detect important information about the geometry of links. In this thesis we explore these connections using an enhanced version of the RT…
We study the number of queries needed to identify a monotone Boolean function $f:\{0,1\}^n \rightarrow \{0,1\}$. A query consists of a 0-1-sequence, and the answer is the value of $f$ on that sequence. It is well-known that the number of…
The main contribution of this paper is a formula for the number of acyclic orientations of a complete bipartite, $K_{n_1,n_2},$ revealing that it is equal to the poly-Bernoulli number $B_{n_1}^{(-n_2)}$ introduced in 1997 by Kaneko. We also…
The paper deals with root problems for two classes of univariate polynomials both of geometric origin. The first class discussed, the class of Steiner polynomial, consists of polynomials, each associated with a compact convex set V in R^n.…
Let $G=(V,E)$ be a simple undirected graph with $n$ vertices then a set partition $\pi=\{V_1, ..., V_k\}$ of the vertex set of $G$ is a connected set partition if each subgraph $G[V_j]$ induced by the blocks $V_j$ of $\pi$ is connected for…
We obtain explicit formulas for the enumeration of labelled parallelogram polyominoes. These are the polyominoes that are bounded, above and below, by north-east lattice paths going from the origin to a point (k,n). The numbers from 1 and n…
We introduce the theory of local and global monodromies of polynomials in cohomology groups in various geometric situations, focusing on its relations with toric geometry and motivic Milnor fibers, and moreover in the modern languages of…
A pathway from one vertex of a quiver to another is a reduced path. We modify the classical definition of quiver representations and we prove that semi-invariant polynomials for filtered quiver representations come from diagonal entries if…
We show that the holonomy of a connection defined on a principal composite bundle is related by a non-abelian Stokes theorem to the composition of the holonomies associated with the connections of the component bundles of the composite. We…
Using the definition of colouring of $2$-edge-coloured graphs derived from $2$-edge-coloured graph homomorphism, we extend the definition of chromatic polynomial to $2$-edge-coloured graphs. We find closed forms for the first three…
In this paper, we present a pathwise construction of multi-soliton solutions for focusing stochastic nonlinear Schr\"odinger equations with linear multiplicative noise, in both the $L^2$-critical and subcritical cases. The constructed…
A connected path decomposition of a simple graph $G$ is a path decomposition $(X_1,\ldots,X_l)$ such that the subgraph of $G$ induced by $X_1\cup\cdots\cup X_i$ is connected for each $i\in\{1,\ldots,l\}$. The connected pathwidth of $G$ is…
Non-relativistic charged particles and strings coupled with abelian gauge fields are quantized in a geometric representation that generalizes the Loop Representation. We consider three models: the string in self-interaction through a…
It is shown that the mean-field description of a boson-fermion mixture with a dominating fermionic component, loaded in a one-dimensional optical lattice, is reduced to the nonlinear Schr\"{o}dinger equation with a periodic potential and…