Related papers: On schemes evinced by generalized additive decompo…
The aim of this note is to present some new explicit examples of $O(d,d)$-generalised Leibniz parallelisable spaces arising as the normal bundles of adjoint orbits $\mathcal{O}$ of some semi-simple Lie group $G$. Using this construction, an…
A locally irregular graph is a graph whose adjacent vertices have distinct degrees. It was conjectured that every connected graph is edge decomposable to $3$ locally irregular subgraphs, unless it belongs to a certain family of exceptions,…
For a given graph whose edges are labeled with general real numbers, we consider the set of functions from the vertex set into the Euclidean plane such that the distance between the images of neighbouring vertices is equal to the…
We give a combinatorial characterization of generic minimal rigidity for planar periodic frameworks. The characterization is a true analogue of the Maxwell-Laman Theorem from rigidity theory: it is stated in terms of a finite combinatorial…
Graph anomaly detection (GAD) has attracted increasing attention in recent years for identifying malicious samples in a wide range of graph-based applications, such as social media and e-commerce. However, most GAD methods assume identical…
We propose a new high order accurate nodal discontinuous Galerkin (DG) method for the solution of nonlinear hyperbolic systems of partial differential equations (PDE) on unstructured polygonal Voronoi meshes. Rather than using classical…
We study algebraic and geometric properties of metric spaces endowed with dilatation structures, which are emergent during the passage through smaller and smaller scales. In the limit we obtain a generalization of metric affine geometry,…
Let $\Gamma$ denote a distance-regular graph with diameter $D \ge 3$. Assume $\Gamma$ has classical parameters $(D,b,\alpha,\beta)$ with $b < -1$. Let $X$ denote the vertex set of $\Gamma$ and let $A \in MX$ denote the adjacency matrix of…
In the article we discuss the notion of the generalized invariant manifold introduced in our previous study. In the literature the method of the differential constraints is well known as a tool for constructing particular solutions for the…
In this paper, we consider systems of algebraic and non-linear partial differential equations and inequations. We decompose these systems into so-called simple subsystems and thereby partition the set of solutions. For algebraic systems,…
In the representation theory of finite-dimensional algebras, the study of projective presentations of maximal rank is closely related to the study of generically $\tau$-regular irreducible components of varieties of modules over such…
We prove a structure theorem for multiplicative functions which states that an arbitrary bounded multiplicative function can be decomposed into two terms, one that is approximately periodic and another that has small Gowers uniformity norm…
Some properties of generalized convexity for sets and for functions are identified in case of the reliability polynomials of two dual minimal networks. A method of approximating the reliability polynomials of two dual minimal network is…
We prove that if $G$ is a finite irreducible solvable subgroup of an orthogonal group $O(V,Q)$ with $\dim V$ odd, then $G$ preserves an orthogonal decomposition of $V$ into $1$-spaces. In particular $G$ is monomial. This generalizes a…
We use methods from algebra and discrete geometry to study the irreducibility of the dispersion polynomial of a discrete periodic operator associated to a periodic graph after changing the period lattice. We provide numerous applications of…
Two new concepts, generic regular decomposition and regular-decomposition-unstable (RDU) variety for generic zero-dimensional systems, are introduced in this paper and an algorithm is proposed for computing a generic regular decomposition…
Explicit, unconditionally stable, high-order schemes for the approximation of some first- andsecond-order linear, time-dependent partial differential equations (PDEs) are proposed.The schemes are based on a weak formulation of a…
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations of these tools focusing on solutions of the real analogue:…
We consider the algebra of invariants of $d$-tuples of $n\times n$ matrices under the action of the orthogonal group by simultaneous conjugation over an infinite field of characteristic $p$ different from two. It is well-known that this…
Computational electrodynamics (CED), the numerical solution of Maxwell's equations, plays an incredibly important role in several problems in science and engineering. High accuracy solutions are desired, and the discontinuous Galerkin (DG)…