Search Results

Let $\lbrace(x_0,y_0),(x_1,y_1),\,\dots,\,(x_n,y_n)\ |\ x_i\ne x_j\rbrace\subset\mathbb{R}^2$ Let $P$ and $Q$ be the polynomials that interpolate $\lbrace(x_0,y_0),(x_1,y_1),\,\dots,\,(x_{n-1},y_{n-1} …

One definition of tree in graph theory could be as follows: A tree is a(n undirected) graph for which there is a unique (undirected) path between any pair of vertices. This suggest a possible defini …

Question: is there a name for the following operation $$\sum_{i=1}^n\sum_{j=1}^mx_iy_j^T,\ x_i,y_j\in \mathbb{R}^k$$ i.e. for generating a square matrix that is the sum of the cartesian product of a …

Question: is there an established name for the set $\Big\lbrace\ f {\Large\ \boldsymbol{|}}\ f\in C^\infty\quad {\Large\boldsymbol{\land}}\quad \exists\,{k\in\mathbb{N}^+}:\frac{d^{i+k}}{dx^{i+k}}f(x) …

If you rewrite to $\boldsymbol{X}\boldsymbol{A}\boldsymbol{X}^T$ there is an answer here Names for the product will depend on the properties of $\boldsymbol{X}$ and $\boldsymbol{A}$

given a bipartite graph $G(U,V,E\subseteq U\times V)$ with strictly positive edge-weights; is there an established name for the the task of calculating the lightest spanning subgraph and what is the b …

The motivation for this question is a statement about the Bellman-Ford algorithm, that doesn't agree with the definition of what a path in a graph is. On wikipedia's description of the Bellman-Ford Al …

Question: is there an established name for sets of $n$ points in the euclidean plane whose shortest Hamilton cycles consists of the $n$ pairs of points having the $n$ smallest distances? Names for sym …

Let $\mathcal{P}$ a finite set of points of a Euclidean $\mathbb{E}^n$ and take the union $\mathrm{U}(\mathcal{P})$ of all closed half-spaces defined by $n$ elements of $\mathcal{P}$ that contain only …

I am pursuing generalizations of planar Euclidean geometry to complete symmetric and weighted graphs, the guiding principle being applicability to the TSP. The operations and tests that are available …

According to the TSP Gallery moats provide lower bounds for the optimal solution of TSP instances. On the webpage they are depicted as blue rings around red disks, whose radii represent maximal vertex …

I have implemented an algorithm that filters the edges of simple complete graph with weighted edges according to a criterion that is inspired by elementary planar geometry and, to my surprise, in the …

Let $f(x)$ be an elementary function defined on $X\subseteq\mathbb{R}$ and $\xi(x), \eta(y)$ strictly monotone for $x\in X,\, y\in f(x)$. Questions: is there an established name for functions of the …

one of the most prominent functions of the first $n$ natural numbers is the factorial $n!$ that denotes their product. Today however I wondered whether the least common multiple $\mathrm{lcm}(n):=\mat …

is there an established name for the property that a square matrix can be made symmetric by permutation of its columns? Is it possible to recognize those kind of matrices efficiently?