English
Related papers

Related papers: Indexes of vector fields for mixed functions

200 papers

In [22] Milnor proved that a real analytic map $f\colon (R^n,0) \to (R^p,0)$, where $n \geq p$, with an isolated critical point at the origin has a fibration on the tube $f|\colon B_\epsilon^n \cap f^{-1}(S_\delta^{p-1}) \to…

Algebraic Geometry · Mathematics 2021-04-12 José Luis Cisneros-Molina , Aurélio Menegon

An integer additive set-indexer is defined as an injective function $f:V(G)\rightarrow 2^{\mathbb{N}_0}$ such that the induced function $f^+:E(G) \rightarrow 2^{\mathbb{N}_0}$ defined by $f^+ (uv) = f(u)+ f(v)$ is also injective. A graph…

Combinatorics · Mathematics 2014-07-21 N. K. Sudev , K. A. Germina

A mixed graph $G$ is a graph obtained from a simple undirected graph by orientating a subset of edges. $G$ is self-converse if it is isomorphic to the graph obtained from $G$ by reversing each directed edge. For two mixed graphs $G$ and $H$…

Combinatorics · Mathematics 2019-12-02 Wei Wang , Lihong Qiu , Jianguo Qian , Wei Wang

A mixed graph is said to be \textit{integral} if all the eigenvalues of its Hermitian adjacency matrix are integer. The \textit{mixed circulant graph} $Circ(\mathbb{Z}_n,\mathcal{C})$ is a mixed graph on the vertex set $\mathbb{Z}_n$ and…

Combinatorics · Mathematics 2022-06-23 Monu Kadyan , Bikash Bhattacharjya

Digital health research has advanced dynamic graph-based disease models, topological learning on simplicial complexes, and multimodal mixture-of-experts architectures, but these strands remain largely disconnected. We propose Graph Vector…

Machine Learning · Computer Science 2026-03-31 Silvano Coletti , Francesca Fallucchi

The aim of this paper is to obtain mixed weak-type inequalities for multilinear fractional operators, extending results by F. Berra, M. Carena and G. Pradolini \cite{BCP}. We prove that, under certain conditions on the weights, there exists…

Classical Analysis and ODEs · Mathematics 2018-10-17 Belén Picardi

The class of index-mixed copulas is introduced and its properties are investigated. Index-mixed copulas are constructed from given base copulas and a random index vector, and show a rather remarkable degree of analytical tractability. The…

Methodology · Statistics 2023-08-10 Klaus Herrmann , Marius Hofert , Nahid Sadr

The integral variation map and algebraic monodromy of isolated plane curve singularities are important homological invariants of the singularity which are still far from being completely understood. This work provides effective ways of…

Algebraic Geometry · Mathematics 2025-12-08 Pablo Portilla Cuadrado , Baldur Sigurðsson

A Poincar\'{e}-Hopf theorem in the spirit of Pugh is proven for compact orbifolds with boundary. The theorem relates the index sum of a smooth vector field in generic contact with the boundary orbifold to the Euler-Satake characteristic of…

Differential Geometry · Mathematics 2009-04-06 Elliot Paquette , Christopher Seaton

In this paper, we use Conley index theory to examine the Poincare index of an isolated invariant set. We obtain some limiting conditions on a critical point of a planar vector field to be an isolated invariant set. As a result we show the…

Dynamical Systems · Mathematics 2007-05-23 M. R. Razvan , M. Fotouhi Firoozabad

Mixed $f$-divergences, a concept from information theory and statistics, measure the difference between multiple pairs of distributions. We introduce them for log concave functions and establish some of their properties. Among them are…

Functional Analysis · Mathematics 2016-06-29 Umut Caglar , Elisabeth M. Werner

Analytic combinatorics in several variables refers to a suite of tools that provide sharp asymptotic estimates for certain combinatorial quantities. In this paper, we apply these tools to determine the Gilbert-Varshamov (GV) bound for the…

Combinatorics · Mathematics 2024-09-04 Goyal Keshav , Duc Tu Dao , Han Mao Kiah , Mladen Kovacevic

Given a closed Riemannian manifold $(M^m,g)$ and a vector field $v$ on $M$, we form the Sasaki metric $g_S$ on $TM$, and restrict it to the image of the cross section map of $M$ into $TM$ defined by $v$, whose pull back to $M$ defines a new…

Differential Geometry · Mathematics 2025-08-26 Santiago R. Simanca

A set-labeling of a graph $G$ is an injective function $f:V(G)\to \mathcal{P}(X)$, where $X$ is a finite set and a set-indexer of $G$ is a set-labeling such that the induced function $f^{\oplus}:E(G)\rightarrow \mathcal{P}(X)-\{\emptyset\}$…

Combinatorics · Mathematics 2015-09-29 N. K. Sudev , K. A. Germina

For a graph $G = (V, E)$, a {\em fractional $[a, b]$-factor} is a real valued function $h:E(G)\to [0,1]$ that satisfies $a \le ~ \sum_{e\in E_G(v)} h(e) ~ \le b$ for all $ v\in V(G)$, where $a$ and $b$ are real numbers and $E_G(v)$ denotes…

Combinatorics · Mathematics 2019-09-04 Mikio Kano , Hongliang Lu , Qinglin Yu

We investigate the relations between the rings ${\bf E}$, ${\bf G}$ and ${\bf D}$ of values taken at algebraic points by arithmetic Gevrey series of order either $-1$ ($E$-functions), $0$ (analytic continuations of $G$-functions) or $1$…

Number Theory · Mathematics 2025-07-14 Stéphane Fischler , Tanguy Rivoal

In this paper, we introduce a matrix for a mixed graph, called the integrated adjacency matrix. This matrix uniquely determines a mixed graph, as long as the indices of the matrix are specified. Additionally, we associate an (undirected)…

Combinatorics · Mathematics 2025-11-27 G. Kalaivani , R. Rajkumar

Given a locally injective real function g on the vertex set V of a finite simple graph G=(V,E), we prove the Poincare-Hopf formula f_G(t) = 1+t sum_{x in V} f_{S_g(x)}(t), where S_g(x) = { y in S(x), g(y) less than g(x) } and f_G(t)=1+f_0 t…

Combinatorics · Mathematics 2019-06-18 Oliver Knill

The Wiener index of a graph $W(G)$ is a well studied topological index for graphs. An outstanding problem of \v{S}olt{\'e}s is to find graphs $G$ such that $W(G)=W(G-v)$ for all vertices $v\in V(G)$, with the only known example being…

Combinatorics · Mathematics 2021-06-23 Sam Spiro

Mixed connectivity is a generalization of vertex and edge connectivity. A graph is $(p,0)$-connected, $p>0$, if the graph remains connected after removal of any $p-1$ vertices. A graph is $(p,q)$-connected, $p\geq 0$, $q>0$, if it remains…

Combinatorics · Mathematics 2010-02-15 Rija Erves , Janez Zerovnik