We describe the implementation of algebraic polyhedra in Normaliz. In addition to convex hull computation/vertex enumeration, it is possible to compute triangulations, volumes, lattice points, face lattices and automorphism groups. The arithmetic is...
A disconnected cut of a connected graph is a vertex cut that itself also induces a disconnected subgraph. The decision problem whether a graph has a disconnected cut is called Disconnected Cut. This problem is closely related to several homomorphism...
Download a Loan Amortization Table spreadsheet for Excel to create your own amortization schedule, table, or calculator.
In the mathematical field of graph theory, a Hamiltonian path (or traceable path) is a path in an undirected or directed graph that visits each vertex
The Heavy Photon Search (HPS) is a new, dedicated experiment at Thomas Jefferson National Accelerator Facility (JLab) to search for a massive vector boson, the heavy photon (a.k.a. dark photon, \Aprimebold{}), in the mass range 20-500~MeV/c$^{2}$ and...
We characterise which simplicial surfaces can be folded onto a triangle. We define a notion of folding that incorporates the non-intersection-properties of real materials. All of the surfaces foldable onto a triangle admit a vertex-3-colouring. Based...
The masses and vertex functions of heavy and heavy-light mesons, described as quark-antiquark bound states, are calculated with the Covariant Spectator Theory (CST). We use a kernel with an adjustable mixture of Lorentz scalar, pseudoscalar, and vect...
We consider the 1015-vertex human consensus connectome computed from the diffusion MRI data of 1064 subjects. We define seven different orders on these 1015 graph vertices, where the orders depend on parameters derived from the brain circuitry, that...
Today I will make my top 5 of the best and worst providers that I have tried in 2025 I will exclude some giants like Google Vertex, Azure and AWS bedrock. The providers placed are not placed in order....
Let $G=(V,E)$ be an undirected graph with $n$ vertices and $m$ edges, in which each vertex $u$ is assigned an integer priority in $[1,n]$, with 1 being the "highest" priority. Let $M$ be a matching of $G$. We define the priority score of $M$ to be an...
Klavžar and Mollard introduced daisy cubes which are interesting isometric subgraphs of $ n$-cubes $Q_n$, induced with intervals between the maximal elements of a poset $ (V (Q_n),\leq)$ and the vertex $ 0^n \in V (Q_n)$. In this paper we show that...
We study a particular chip-firing process on an infinite path graph. At any time when there are at least $a+b$ chips at a vertex, $a$ chips fire to the left and $b$ chips fire to the right. We describe the final state of this process when we start wi...
[**Global Petcare Packaging Market**](https://vertexmarketinsights.com/report/32667/global-petcare-packaging-market-status-2015-2019-and-forecast-2020-2024-by-region-product-type-end-use/) report g...
The status of a vertex $v$ in a connected graph is the sum of the distances from $v$ to all other vertices. The status sequence of a connected graph is the list of the statuses of all the vertices of the graph. In this paper we investigate the status...
For a vertex $u$ of a tree $T$, the leaf (internal, respectively) status of $u$ is the sum of the distances from $u$ to all leaves (internal vertices, respectively) of $T$. The minimum (maximum, respectively) leaf status of a tree $T$ is the minimum...
In the work is considered one of up to now unsolved by Hugo Steinhaus task on having integer length square and located in its plane point that are on integer distances from its vertexes....
The pressing game on black-and-white graphs is the following: Given a graph $G(V,E)$ with its vertices colored with black and white, any black vertex $v$ can be pressed, which has the following effect: (a) all neighbors of $v$ change color, i.e. whit...
Let $X$ and $Y$ be any two graphs of order $n$. The friends-and-strangers graph $\mathsf{FS}(X,Y)$ of $X$ and $Y$ is a graph with vertex set consisting of all bijections $σ:V(X) \mapsto V(Y)$, in which two bijections $σ$, $σ'$ are adjacent if and...
A $(1+\varepsilon)$-stretch tree cover of an edge-weighted $n$-vertex graph $G$ is a collection of trees, where every pair of vertices has a $(1+\varepsilon)$-stretch path in one of the trees. The celebrated Dumbbell Theorem by Arya et. al. [STOC'95]...
We consider the centre of the affine vertex algebra at the critical level associated with the orthosymplectic Lie superalgebra. It is well-known that the centre is a commutative superalgebra, and we construct a family of its elements in an explicit f...