Related papers: Separable discrete functions: recognition and suff…

Assume that $f$ is the characteristic function of a probability measure $\mu_f$ on $R^n$. Let $\sigma>0$. We study the following extrapolation problem: under what conditions on the neighborhood of infinity $V_{\sigma}=\{x\in R^n:…

The additively separable hedonic game (ASHG) is a model of coalition formation games on graphs. In this paper, we intensively and extensively investigate the computational complexity of finding several desirable solutions, such as a Nash…

This paper studies the problem of {\em learning} the probability distribution $P_X$ of a discrete random variable $X$ using indirect and sequential samples. At each time step, we choose one of the possible $K$ functions, $g_1, \ldots, g_K$…

Let G be an undirected simple graph having n vertices and let f be a function defined to be f:V(G) -> {0,..., n-1}. An f-factor of G is a spanning subgraph H such that degree of a vertex v in H is f(v) for every vertex v in V(G). The…

For each positive integer $n$, function $f$, and point $c$, the GGR Theorem states that $f$ is $n$ times Peano differentiable at $c$ if and only if $f$ is $n-1$ times Peano differentiable at $c$ and the following $n$-th generalized…

We discuss some aspects of approximating functions on high-dimensional data sets with additive functions or ANOVA decompositions, that is, sums of functions depending on fewer variables each. It is seen that under appropriate smoothness…

The study gives a brief overview of existing modifications of the method of functional separation of variables for nonlinear PDEs. It proposes a more general approach to the construction of exact solutions to nonlinear equations of applied…

Separability is one of the most basic and important topological properties. In this paper, the separability in (strongly) topological gyrogroups is studied. It is proved that every first-countable left {\omega}-narrow strongly topological…

A space $X$ is M-separable (selectively separable) (Scheepers, 1999; Bella et al., 2009) if for every sequence $(Y_n)$ of dense subspaces of $X$ there exists a sequence $(F_n)$ such that for each $n$ $F_n$ is a finite subset of $Y_n$ and…

Functionality ($\mathrm{fun}$) is a graph parameter that generalizes graph degeneracy defined by Alecu et al. [JCTB, 2021]. They research the relation of functionality to many other graphs parameters (tree-width, clique-width, VC-dimension,…

In graph realization problems one is given a degree sequence and the task is to decide whether there is a graph whose vertex degrees match to the given sequence. This realization problem is known to be polynomial-time solvable when the…

This paper investigates some necessary and sufficient conditions for a game to be a potential game. At first, we extend the classical results of Slade and Monderer and Shapley from games with one-dimensional action spaces to games with…

The validity OF a causal model can be tested ONLY IF the model imposes constraints ON the probability distribution that governs the generated data. IN the presence OF unmeasured variables, causal models may impose two types OF constraints :…

In standard fair division models, we assume that all agents are selfish. However, in many scenarios, division of resources has a direct impact on the whole group or even society. Therefore, we study fair allocations of indivisible items…

A subgroup $H$ of a finite group $G$ is said to be an NC-subgroup of $G$, if $ H^G N_G (H) =G$, where $H^G$ denotes the normal closure of $H$ in $G$. A finite group $G$ is called a PNC-group, if any subgroup of $G$ is an NC-subgroup of $G$,…

We study the problem of recovering a function from the magnitude of its Gabor transform sampled on a discrete set. While it is known that uniqueness fails for general square integrable functions, we show that phase retrieval is possible for…

For a group $G$ acting on an affine variety $X$, the separating variety is the closed subvariety of $X\times X$ encoding which points of $X$ are separated by invariants. We concentrate on the indecomposable rational linear representations…

Let $\gamma_g(G)$ and $\gamma_{tg}(G)$ be the game domination number and the total game domination number of a graph $G$, respectively. Then $G$ is $\gamma_g$-perfect (resp. $\gamma_{tg}$-perfect), if every induced subgraph $F$ of $G$…

It is proved that every function of finite Baire index on a separable metric space $K$ is a $D$-function, i.e., a difference of bounded semi-continuous functions on $K$. In fact it is a strong $D$-function, meaning it can be approximated…

In a variety of applications, including nonparametric instrumental variable (NPIV) analysis, proximal causal inference under unmeasured confounding, and missing-not-at-random data with shadow variables, we are interested in inference on a…