University of Architecture, Civil Engineering and Geodesy

output

20082023

most citedUnconditional convergence and invertibility of multipliers

70 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

12 papers

q-fin.CP2023

A Deep Reinforcement Learning Trader without Offline Training

Boian Lazov

In this paper we pursue the question of a fully online trading algorithm (i.e. one that does not need offline training on previously gathered data). For this task we use Double Dee…

math.NT2020

Sum of Three Cubes via Optimisation

Boian Lazov, Tsvetan Vetsov

By first solving the equation $x^{3} + y^{3} + z^{3} = k$ with fixed $k$ for $z$ and then considering the distance to the nearest integer function of the result, we turn the sum of three cubes…

math.NA2018

Better numerical approximation by Durrmeyer type operators

Ana Maria Acu, Vijay Gupta, Gancho Tachev

The main object of this paper is to construct new Durrmeyer type operators which have better features than the classical one. Some results concerning the rate of convergence and as…

math.CO2018

Changing and unchanging 2-rainbow independent domination

Pu Wu, Zehui Shao, Vladimir Samodivkin +3

For a function $f : V (G) \to {0, 1, 2}$ we denote by $V_{i}$ the set of vertices to which the value $i$ is assigned by $f$ , i.e. $V_{i} = {x \in V (G) : f (x) = i}$ . If…

math.CO2016

Roman domination excellent graphs: trees

Vladimir Samodivkin

A Roman dominating function (RDF) on a graph $G = (V, E)$ is a labeling $f : V \to {0, 1, 2}$ such that every vertex with label $0$ has a neighbor with label $2$ . The wei…

math.CO2016

Hypo-efficient domination and hypo-unique domination

Vladimir Samodivkin

For a graph $G$ let $γ (G)$ be its domination number. We define a graph G to be (i) a hypo-efficient domination graph (or a hypo- $E D$ graph) if $G$ has no efficient domina…

math.CO2013★ 2 cited

A lower bound for the algebraic connectivity of a graph in terms of the domination number

Yi-Zheng Fan, Ying-Ying Tan

We investigate how the algebraic connectivity of a graph changes by relocating a connected branch from one vertex to another vertex, and then minimize the algebraic connectivity am…

math.CO2013

Upper bounds for domination related parameters in graphs on surfaces

Vladimir Samodivkin

In this paper we give tight upper bounds on the total domination number, the weakly connected domination number and the connected domination number of a graph in terms of order and…

math.FA2010

Classification of General Sequences by Frame-Related Operators

Peter Balazs, Diana T. Stoeva, Jean-Pierre Antoine

This note is a survey and collection of results, as well as presenting some original research. For Bessel sequences and frames, the analysis, synthesis and frame operators as well…

math.FA2009★ 70 cited

Unconditional convergence and invertibility of multipliers

D. Stoeva, P. Balazs

In the present paper the unconditional convergence and the invertibility of multipliers is investigated. Multipliers are operators created by (frame-like) analysis, multiplication…

math.FA2009★ 4 cited

Perturbation of frames in Banach spaces

Diana T. Stoeva

In this paper we consider perturbation of X_d-Bessel sequences, X_d-frames, Banach frames, atomic decompositions and X_d-Riesz bases in separable Banach spaces. Equivalence between…

math.FA2008★ 2 cited

On sequence spaces for Fréchet frames

Stevan Pilipović, Diana T. Stoeva

We analyze the construction of a sequence space $Θ$ , resp. a sequence of sequence spaces, in order to have ${g_{i}}$ as a $Θ$ -frame or Banach frame for a Banach…