Related papers: A Note on Nonuniform versus Uniform ACC^k Circuits…
The cycles are the only $2$-connected graphs in which any two nonadjacent vertices form a vertex cut. We generalize this fact by proving that for every integer $k\ge 3$ there exists a unique graph $G$ satisfying the following conditions:…
An $R$-module $M$ is called virtually uniserial if for every finitely generated submodule $0 \neq K \subseteq M$, $K/$Rad$(K)$ is virtually simple. In this paper, we generalize virtually uniserial modules by dropping the virtually simple…
Two structures are said to be equimorphic if each embeds in the other. Such structures cannot be expected to be isomorphic, and in this paper we investigate the special case of linear orders, here also called chains. In particular we…
Arbitrary exponentially large unitaries cannot be implemented efficiently by quantum circuits. However, we show that quantum circuits can efficiently implement any unitary provided it has at most polynomially many nonzero entries in any row…
A $k$-colouring (not necessarily proper) of vertices of a graph is called {\it acyclic}, if for every pair of distinct colours $i$ and $j$ the subgraph induced by the edges whose endpoints have colours $i$ and $j$ is acyclic. In the paper…
For any given integer $r\geqslant 3$, let $k=k(n)$ be an integer with $r\leqslant k\leqslant n$. A hypergraph is $r$-uniform if each edge is a set of $r$ vertices, and is said to be linear if two edges intersect in at most one vertex. Let…
Given a boolean n by n matrix A we consider arithmetic circuits for computing the transformation x->Ax over different semirings. Namely, we study three circuit models: monotone OR-circuits, monotone SUM-circuits (addition of non-negative…
A coherent system of type (r,d,k) on a curve C is a pair (E,V) where E is a vector bundle of rank r and degree d and V is a space of sections of E of dimension k. There is a condition of stability on coherent systems that depends on a…
We prove that for all natural numbers $m$ and $k$ where $k$ is odd, there exists a natural number $N(k)$ such that any 3-connected cubic graph with at least $N(k)$ vertices contains a cycle of length $m$ modulo $k$. We also construct a…
A directed acyclic graph G = (V, E) is pseudo-transitive with respect to a given subset of edges E1, if for any edge ab in E1 and any edge bc in E, we have ac in E. We give algorithms for computing longest chains and demonstrate geometric…
In this paper, we give a criterion on instability of an equilibrium of nonlinear Caputo fractional differential systems. More precisely, we prove that if the spectrum of the linearization has at least one eigenvalue in the sector…
Every noncompact surface is shown to have a (3,6)-tight triangulation, and applications are given to the generic rigidity of countable bar-joint frameworks in R^3. In particular, every noncompact surface has a (3,6)-tight triangulation that…
Properties of graphs that can be characterized by the spectrum of the adjacency matrix of the graph have been studied systematically recently. Motivated by the complexity of these properties, we show that there are such properties for which…
We construct classes of ${\cal N}=1$ superconformal theories elements of which are labeled by punctured Riemann surfaces. Degenerations of the surfaces correspond, in some cases, to weak coupling limits. Different classes are labeled by two…
We calculate the AC conductance and the finite-frequency non-symmetrized noise in interacting quantum wires and single-wall carbon nanotubes in the presence of an impurity. We observe a strong asymmetry in the frequency spectrum of the…
In this paper, we discuss on the linearized stability of the trivial solution for a class of nonlinear Caputo fractional differential systems of order $\alpha\in(1,2)$. We show that some recent existing results in this direction are wrong.…
k-Component q-deformed charge coherent states are constructed, their (over)completeness proved and their generation explored. The q-deformed charge coherent states and the even (odd) q-deformed charge coherent states are the two special…
We introduce symmetric arithmetic circuits, i.e. arithmetic circuits with a natural symmetry restriction. In the context of circuits computing polynomials defined on a matrix of variables, such as the determinant or the permanent, the…
We study the existence of invariant quadrics for a class of systems of difference equations in ${\mathbb R}^n$ defined by linear fractionals sharing denominator. Such systems can be described in terms of some square matrix $A$ and we prove…
We present a framework for studying circuit complexity that is inspired by techniques that are used for analyzing the complexity of CSPs. We prove that the circuit complexity of a Boolean function $f$ is characterized by the partial…