English
Related papers

Related papers: Total dual dyadicness and dyadic generating sets

200 papers

For every integer $k \geq 2$ and every $A \subseteq \mathbb{N}$, we define the \emph{$k$-directions sets} of $A$ as $D^k(A) := \{{\bf a} / \|{\bf a}\| : {\bf a} \in A^k\}$ and $D^{\underline{k}}(A) := \{{\bf a} / \|{\bf a}\| : {\bf a} \in…

Number Theory · Mathematics 2020-12-15 Paolo Leonetti , Carlo Sanna

Given an $n\times n$ symmetric matrix $W\in [0,1]^{[n]\times [n]}$, let $\mathcal{G}(n,W)$ be the random graph obtained by independently including each edge $jk$ with probability $W_{jk}$. Given a degree sequence ${\bf d}=(d_1,\ldots,…

Combinatorics · Mathematics 2024-12-11 Pu Gao , Yuval Ohapkin

A set $S\subseteq V$ of a graph $G=(V,E)$ is a dominating set if each vertex has a neighbor in $S$ or belongs to $S$. Dominating Set is the problem of deciding, given a graph $G$ and an integer $k\geq 1$, if $G$ has a dominating set of size…

Combinatorics · Mathematics 2023-04-20 Valentin Bouquet , François Delbot , Christophe Picouleau , Stéphane Rovedakis

In a graph $\Gamma$ with vertex set $V$, a subset $C$ of $V$ is called an $(a,b)$-perfect set if every vertex in $C$ has exactly $a$ neighbors in $C$ and every vertex in $V\setminus C$ has exactly $b$ neighbors in $C$, where $a$ and $b$ are…

Combinatorics · Mathematics 2022-11-07 Yanpeng Wang , Binzhou Xia , Sanming Zhou

A group $G$ is said to be $k$-generated if it has a generating set with $k$ elements. A positive integer $n$ is called a \emph{2-generated number} if every group of order $n$ is 2-generated. In this article, we establish an arithmetic…

Group Theory · Mathematics 2025-08-25 Bireswar Das , Kavita Samant , Dhara Thakkar

Given a polynomial matrix P(x) of grade g and a rational function $x(y) = n(y)/d(y)$, where $n(y)$ and $d(y)$ are coprime nonzero scalar polynomials, the polynomial matrix $Q(y) :=[d(y)]^gP(x(y))$ is defined. The complete eigenstructures of…

Numerical Analysis · Mathematics 2012-04-16 Vanni Noferini

A new computational method that uses polynomial equations and dynamical systems to evaluate logical propositions is introduced and applied to Goedel's incompleteness theorems. The truth value of a logical formula subject to a set of axioms…

General Mathematics · Mathematics 2011-12-23 Joseph W. Norman

For a topological dynamical system $(X, T)$ we define a uniform generator as a finite measurable partition such that the symmetric cylinder sets in the generated process shrink in diameter uniformly to zero. The problem of existence and…

Dynamical Systems · Mathematics 2017-05-25 David Burguet , Tomasz Downarowicz

Let $X$ be a connected affine homogenous space of a linear algebraic group $G$ over $\C$. (1) If $X$ is different from a line or a torus we show that the space of all algebraic vector fields on $X$ coincides with the Lie algebra generated…

Complex Variables · Mathematics 2015-08-03 Shulim Kaliman , Frank Kutzschebauch

A rational Diophantine triple is a set of three nonzero rational a,b,c with the property that ab+1, ac+1, bc+1 are perfect squares. We say that the elliptic curve y^2 = (ax+1)(bx+1)(cx+1) is induced by the triple {a,b,c}. In this paper, we…

Number Theory · Mathematics 2020-12-22 Andrej Dujella , Juan Carlos Peral

Two series of W-algebras with two generators are constructed from chiral vertex operators of a free field representation. If $c = 1 - 24k$, there exists a W(2,3k) algebra for k in $Z_{+}/2$ and a W(2,8k) algebra for k in $Z_{+}/4$. All…

High Energy Physics - Theory · Physics 2009-10-22 Michael Flohr

In this paper, we study the well-posedness of backward doubly stochastic differential equations (BDSDEs), both with and without reflection, under weak conditions. First, when the generator $f$ is of general growth in $y$ and linear growth…

Probability · Mathematics 2026-03-17 Shuxian Gao , Ying Hu , Jiaqiang Wen

In the total matching problem, one is given a graph $G$ with weights on the vertices and edges. The goal is to find a maximum weight set of vertices and edges that is the non-incident union of a stable set and a matching. We consider the…

Combinatorics · Mathematics 2024-01-01 Luca Ferrarini , Samuel Fiorini , Stefan Kober , Yelena Yuditsky

A vertex set $D$ in a finite undirected graph $G$ is an {\em efficient dominating set} (\emph{e.d.s.}\ for short) of $G$ if every vertex of $G$ is dominated by exactly one vertex of $D$. The \emph{Efficient Domination} (ED) problem, which…

Discrete Mathematics · Computer Science 2019-07-24 Andreas Brandstädt , Raffaele Mosca

We develop a homological duality framework based on a contravariant functor $D=\operatorname{Hom}_E(-,R)$ with dualizing object $R$. A morphism is called ethic when it satisfies the canonical double-dual compatibility $D^2(f)\eta=\eta f$.…

Category Theory · Mathematics 2025-12-22 Dmitry Pasechnyuk-Vilensky , Martin Takáč

This paper is devoted to study some properties of the k-dimensional Lyness' map. Our main result presentes a rational vector field that gives a Lie symmetry for F. This vector field is used, for k less or equal to 5 to give information…

Dynamical Systems · Mathematics 2010-12-23 Anna Cima , Armengol Gasull , Victor Manosa

We study the number of tilings of skew Young diagrams by ribbon tiles shaped like Dyck paths, in which the tiles are "vertically decreasing". We use these quantities to compute pairing probabilities in the double-dimer model: Given a planar…

Combinatorics · Mathematics 2012-05-31 Richard W. Kenyon , David B. Wilson

We study the Lie algebra of polynomial vector fields on a smooth Danielewski surface of the form $x y = p(z)$ with $x,y,z \in \mathbb{C}$. We provide explicitly given generators to show that: 1. The Lie algebra of polynomial vector fields…

Complex Variables · Mathematics 2026-04-13 Rafael B. Andrist

We study modules for the divided power algebra $D$ in a single variable over a commutative noetherian ring $k$. Our first result states that $D$ is a coherent ring. In fact, we show that there is a theory of Gr\"obner bases for finitely…

Commutative Algebra · Mathematics 2018-02-20 Rohit Nagpal , Andrew Snowden

{\em Honeycomb toroidal graphs} are a family of cubic graphs determined by a set of three parameters, that have been studied over the last three decades both by mathematicians and computer scientists. They can all be embedded on a torus and…

Combinatorics · Mathematics 2024-12-09 Primoz Sparl