Related papers: Constructing a polynomial whose nodal set is any p…
We consider deep neural networks, in which the output of each node is a quadratic function of its inputs. Similar to other deep architectures, these networks can compactly represent any function on a finite training set. The main goal of…
It is shown how a connected graph and a tree with partially prescribed spectrum can be constructed. These constructions are based on a recent result of Salez that every totally real algebraic integer is an eigenvalue of a tree. Our result…
Let $n\geq 3$ and $r_n$ be a $3$-polytopal graph such that for every $3\leq i\leq n$, $r_n$ has at least one vertex of degree $i$. We find the minimal vertex count for $r_n$. We then describe an algorithm to construct the graphs $r_n$. A…
In this paper, we give some necessary and sufficient conditions for a normal subgroup of an amalgamated product of groups to be finitely generated. We apply these conditions together with Stallings' fibering theorem to prove that an…
In social networks the {\sc Strong Triadic Closure} is an assignment of the edges with strong or weak labels such that any two vertices that have a common neighbor with a strong edge are adjacent. The problem of maximizing the number of…
We investigate the problem of cryptanalysis as a problem belonging to the class NP. A class of problems UF is defined for which the time constructing any feasible solution is polynomial. The properties of the problems of NP, which may be…
A subset $B \subset Y$ is constructible if it is an element of the smallest family that contains all open sets and is stable under finite intersections and complements. A function $f : X \to Y$ is said to be piece-wise closed if $X$ can be…
We use the implicitization procedure to generate polynomial equality constraints on the set of distributions induced by local interventions on variables governed by a causal Bayesian network with hidden variables. We show how we may reduce…
A double star is a tree with two internal vertices. It is known that the Gy\'arf\'as-Sumner conjecture holds for double stars, that is, for every double star $H$, there is a function $f$ such that if $G$ does not contain $H$ as an induced…
We give uniform, explicit, and simple face-pairing descriptions of all the branched cyclic covers of the 3-sphere, branched over two-bridge knots. Our method is to use the bi-twisted face-pairing constructions of Cannon, Floyd, and Parry;…
Given a 4-tangle shadow, we concatenate it with itself n times and form a knot by applying a closure operation that connects each top endpoint to the corresponding bottom endpoint on the same side without introducing any crossings. We then…
We study the neighborhood polynomial and the complexity of its computation for chordal graphs. The neighborhood polynomial of a graph is the generating function of subsets of its vertices that have a common neighbor. We introduce a…
We introduce the notion of a (strongly) inner non-degenerate mixed function $f:\mathbb{C}^2\to\mathbb{C}$. We show that inner non-degenerate mixed polynomials have weakly isolated singularities and strongly inner non-degenerate mixed…
By studying braid group actions on Milnor's construction of the 1-sphere, we show that the general higher homotopy group of the 3-sphere is the fixed set of the pure braid group action on certain combinatorially described group. We also…
One matrix structure in the area of monotone Boolean functions is defined here. Some of its combinatorial, algebraic and algorithmic properties are derived. On the base of these properties, three algorithms are built. First of them…
We study monic univariate polynomials whose coefficients are analytic functions of a real variable and whose roots lie in a specified analytic curve. These include characteristic polynomials of unitary and hermitian matrices whose entries…
We prove that every knot type in $\mathbb{R}^3$ can be parametrised by a smooth function $f:S^1\to\mathbb{R}^3$, $f(t)=(x(t),y(t),z(t))$ such that all derivatives $f^{(n)}(t)=(x^{(n)}(t),y^{(n)}(t),z^{(n)}(t))$, $n\in\mathbb{N}$,…
Given any square matrix or a bounded operator $A$ in a Hilbert space such that $p(A)$ is normal (or similar to normal), we construct a Banach algebra, depending on the polynomial $p$, for which a simple functional calculus holds. When the…
A graph $G$ is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function $w$ is defined on its vertices. Then $G$ is $w$-well-covered if all maximal independent sets are of the same weight.…
We show that there are only finitely many homogeneous links whose Conway polynomial has any given degree. Using this we give an example of an inhomogeneous, fibred knot. Secondly, we show how to compute the monodromy of a homogeneous link…