Related papers: Multi-linear forms, structure of graphs and Lebesg…

Many mathematical models have been leveraged to design embeddings for representing Knowledge Graph (KG) entities and relations for link prediction and many downstream tasks. These mathematically-inspired models are not only highly scalable…

Let K be a self-similar or self-affine set in R^d, let \mu be a self-similar or self-affine measure on it, and let G be the group of affine maps, similitudes, isometries or translations of R^d. Under various assumptions (such as separation…

The existence of a connected 12-regular $\{K_4,K_{2,2,2}\}$-ultrahomogeneous graph $G$ is established, (i.e. each isomorphism between two copies of $K_4$ or $K_{2,2,2}$ in $G$ extends to an automorphism of $G$), with the 42 ordered lines of…

In this note, we review the latest qualitative results, referring to the Li\'enard Equation, in the framework of non-conformable, generalized and fractional differential operators.

Menger's Theorem is a fundamental result in graph theory. It states that if in a graph $G$ with distinguished sets of terminal vertices $S$ and $T$ there are no $k$ pairwise vertex-disjoint $S$-$T$ paths, then there is a set of less than…

Let $G$ be a connected graph and $\mathcal{P}(G)$ a graph parameter. We say that $\mathcal{P}(G)$ is feasible if $\mathcal{P}(G)$ satisfies the following properties: (I) $\mathcal{P}(G)\leq \mathcal{P}(G_{uv})$, if $G_{uv}=G[u\to v]$ for…

Let $G$ be a finite simple graph on the vertex set $V(G) = \{x_1, \ldots, x_n\}$ and $I(G) \subset K[V(G)]$ its edge ideal, where $K[V(G)]$ is the polynomial ring in $x_1, \ldots, x_n$ over a field $K$ with each ${\rm deg} x_i = 1$ and…

In a graph $A$, the measure $|M_g^A(f)|=m_g^A(f)$ for each arbitrary edge $f=gh$ counts the edges in $A$ closer to $g$ than $h$. $A$ is termed an edge quasi-$\lambda$-distance-balanced graph in a metric space (abbreviated as $EQDBG$), where…

We use results about Fourier coefficients appearing in [T] (and some more obtained here), to obtain information for certain among the integrals of the form $$I=\int_{GL_n(\kkk)Z_n(\A)\s GL_n(\A)}\varphi(g)\phi(g)\F(E)(\tj(g))dg$$ where:…

Defining distances over finite fields formally by $||x-y||:=(x_1-y_1)^2+\cdots + (x_d-y_d)^2$ for $x,y\in \mathbb{F}_q^d$, distance problems naturally arise in analogy to those studied by Erd\H{o}s and Falconer in Euclidean space. Given a…

In measure theory several results are known how measure spaces are transformed into each other. But since moment functionals are represented by a measure we investigate in this study the effects and implications of these measure…

In this paper, we study multiplicative structures on the K-theory of the core $A:=C^*(E)^{U(1)}$ of the C*-algebra $C^*(E)$ of a directed graph $E$. In the first part of the paper, we study embeddings $E\to E\times E$ that induce a…

We study operators of the form $$ Tf(x)= \psi(x) \int f(\gamma_t(x))K(t)\,dt, $$ where $\gamma_t(x)$ is a real analytic function of $(t,x)$ mapping from a neighborhood of $(0,0)$ in $\mathbb{R}^N \times \mathbb{R}^n$ into $\mathbb{R}^n$…

We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems, LICS, 2004]. We introduce a graph-like structure on an…

We present one-dimensional KKR method with the aim to elucidate its linear features, particularly important in optimizing the numerical algorithms in energy bands computations. The conventional KKR equations based on the multiple scattering…

Let $G$ be a connected graph. For an ordered set $S=\{v_1,\ldots, v_\ell\}\subseteq V(G)$, the vector $r_G(v|S) = (d_G(v_1,v), \ldots, d_G(v_\ell,v))$ is called the metric $S$-representation of $v$. If for any pair of different vertices…

For an iterated function system (IFS) of simillitidues, we define two graphs on the representing symbolic space. We show that if the self-similar set $K$ has positive Lebesgue measure or the IFS satisfies the weak separation condition, then…

We show that the kernel $K(x,y)={1\over 2}+\lfloor {1\over xy}\rfloor -{1\over xy}$ ($0<x,y\leq 1$) has infinitely many positive eigenvalues and infinitely many negative eigenvalues. Our interest in this kernel is motivated by the…

The deficiency of a graph $G$, denoted by $\kd(G)$, is the number of vertices not saturated by a maximum matching. A bone $B_i$ is the tree obtained by attaching two pendent edges to each of the end vertices of a path $P_{i}$. The local…

Measurement incompatibility--the impossibility of jointly measuring certain quantum observables--is a fundamental resource for quantum information processing. We develop a graph-theoretic framework for quantifying this resource for large…