Related papers: Total dual dyadicness and dyadic generating sets

Let $G=(V, E)$ be a graph where $V$ and $E$ are the vertex and edge sets, respectively. For two disjoint subsets $A$ and $B$ of $V$, we say $A$ \textit{dominates} $B$ if every vertex of $B$ is adjacent to at least one vertex of $A$ in $G$.…

Let K be a field of any characteristic and let R be an algebra generated by two elements satisfying quadratic equations. Then R is a homomorphic image of F=K<x,y | x^2+ax+b=0,y^2+cy+d=0> for suitable a,b,c,d in K. We establish that F can be…

We prove a number of results related to the computational complexity of recognizing well-covered graphs. Let $k$ and $s$ be positive integers and let $G$ be a graph. Then $G$ is said - $\mathbf{W_k}$ if for any $k$ pairwise disjoint…

A 2-dimensional framework is a straight line realisation of a graph in the Euclidean plane. It is radically solvable if the set of vertex coordinates is contained in a radical extension of the field of rationals extended by the squared edge…

We consider the polynomials $\displaystyle f(x)=x^d+c$, where $d\ge 2$ and $c\in\mathbb Q$. It is conjectured that if $d=2$, then $f$ has no rational periodic point of exact period $N\ge 4$. In this note, fixing some integer $d\ge 2$, we…

Let $X$ be a set of cardinality $\kappa$ such that $\kappa^\omega=\kappa$. We prove that the linear algebra $\mathbb{R}^X$ (or $\mathbb{C}^X$) contains a free linear algebra with $2^\kappa$ generators. Using this, we prove several…

We present fully polynomial-time (deterministic or randomised) approximation schemes for Holant problems, defined by a non-negative constraint function satisfying a generalised second order recurrence modulo a couple of exceptional cases.…

The \emph{thinness} of a graph is a width parameter that generalizes some properties of interval graphs, which are exactly the graphs of thinness one. Graphs with thinness at most two include, for example, bipartite convex graphs. Many…

For a graph $G$, a subset $S\subseteq V(G)$ is called a resolving set of $G$ if, for any two vertices $u,v\in V(G)$, there exists a vertex $w\in S$ such that $d(w,u)\neq d(w,v)$. The Metric Dimension problem takes as input a graph $G$ on…

We initiate the study of the Diverse Pair of (Maximum/ Perfect) Matchings problems which given a graph $G$ and an integer $k$, ask whether $G$ has two (maximum/perfect) matchings whose symmetric difference is at least $k$. Diverse Pair of…

For an arbitrary partially ordered set $P$ its {\em dual} $P^*$ is built as the collection of all monotone mappings $P\to\2$ where $\2=\{0,1\}$ with $0<1$. The set of mappings $P^*$ is proved to be a complete lattice with respect to the…

In this article we present theoretical and computational results on the existence of polyhedral embeddings of graphs. The emphasis is on cubic graphs. We also describe an efficient algorithm to compute all polyhedral embeddings of a given…

A rational perfect cuboid is a rectangular parallelepiped whose edges and face diagonals are given by rational numbers and whose space diagonal is equal to unity. It is described by a system of four equations with respect to six variables.…

A dominating set of a graph is a set of vertices such that every vertex not in the set has at least one neighbor in the set. The problem of counting dominating sets is #P-complete for chordal graphs but solvable in polynomial time for its…

The duality symmetry of free electromagnetic field is analyzed within an algebraic approach. To this end, the conformal $c(1,3)$ algebra generators are expressed as operators quadratic in some abstract operators $\kappa^\alpha$ and…

Consider the equation $q_1\alpha^{x_1}+\dots+q_k\alpha^{x_k} = q$, with constants $\alpha \in \overline{\mathbb{Q}} \setminus \{0,1\}$, $q_1,\ldots,q_k,q\in\overline{\mathbb{Q}}$ and unknowns $x_1,\ldots,x_k$, referred to in this paper as…

In this work we characterize a full Kostant-Toda system in terms of a family of matrix polynomials orthogonal with respect to a complex matrix measure. In order to study the solution of this dynamical system we give explicit expressions for…

This paper addresses the study of algebraic versions of Farkas lemma and strong duality results in the very broad setting of infinite-dimensional conic linear programming in dual pairs of vector spaces. To this end, purely algebraic…

We discuss an interesting duality known to occur for certain complex reflection groups, namely the duality groups. Our main construction yields a concrete, representation theoretic realisation of this duality. This allows us to naturally…

In this article, we study some potential theoretical and topological aspects of the generalized Mandelbrot set introduced by Baker and DeMarco. For $\alpha$ real, we study the set of all totally real algebraic parameters $c$ such that…