Related papers: Axiomatizing rectangular grids with no extra non-u…
We give a construction that takes a simple linear algebraic group $G$ over a field and produces a commutative, unital, and simple non-associative algebra $A$ over that field. Two attractions of this construction are that (1) when $G$ has…
We introduce a class of algebras over a field $\mathbb{F}$ related to directed graphs in which all edges are labeled by nonzero elements of the field $\mathbb{F}$. If all labels are different from $1$, these algebras are axial algebras. We…
We present a new technique for the numerical simulation of axisymmetric systems. This technique avoids the coordinate singularities which often arise when cylindrical or polar-spherical coordinate finite difference grids are used,…
A formula $\phi$ is called \emph{$n$-provable} in a formal arithmetical theory $S$ if $\phi$ is provable in $S$ together with all true arithmetical $\Pi_{n}$-sentences taken as additional axioms. While in general the set of all $n$-provable…
This paper extends the results of the previous work of the authors on the classification on noncommutative domain algebras up to completely isometric isomorphism. Using Sunada's classification of Reinhardt domains in $C^n$, we show that…
A graph G is {\xi}-nearly planar if it can be embedded in the sphere so that each of its edges is crossed at most {\xi} times. The family of {\xi}-nearly planar graphs is widely extending the notion of planarity. We introduce an alternative…
We prove that the theory of the Farey graph is pseudofinite by constructing a sequence of finite structures that satisfy increasingly large subsets of its first-order axiomatization. This graph is an important object in the study of curve…
We study two-dimensional supersymmetric non-linear sigma-models with boundaries. We derive the most general family of boundary conditions in the non-supersymmetric case. Next we show that no further conditions arise when passing to the N=1…
We propose a method for numerical relativity in which the spatial grid is finite and no outer boundary condition is needed. As a "proof of concept" we implement this method for the case of a self-gravitating, spherically symmetric scalar…
In various application fields, such as fluid-, cell-, or crowd-simulations, spatial data structures are very important. They answer nearest neighbor queries which are instrumental in performing necessary computations for, e.g., taking the…
We consider a family of linear systems $A_\mu \alpha=C$ with system matrix $A_\mu$ depending on a parameter $\mu$ and for simplicity parameter-independent right-hand side $C$. These linear systems typically result from the…
In this paper, we prove that the world of near-vector spaces allows us to work with non-linear problems and yet, gives access to most of the tools linear algebra has to offer. We establish some fundamental results for near-vector spaces…
The spectrum of a first-order sentence is the set of the cardinalities of its finite models. In this paper, we consider the spectra of sentences over binary relations that use at least three variables. We show that for every such sentence…
We show that for finite n at least 3, every first-order axiomatisation of the varieties of representable n-dimensional cylindric algebras, diagonal-free cylindric algebras, polyadic algebras, and polyadic equality algebras contains an…
The aim of the paper is to attach a noncommutative cluster-like structure to each marked surface $\Sigma$. This is a noncommutative algebra ${\mathcal A}_\Sigma$ generated by "noncommutative geodesics" between marked points subject to…
We consider algebras over a field K, generated by two variables x and y subject to the single relation yx = qxy + ax + by + c for q in K^* and a, b, c in K. We prove, that among such algebras there are precisely five isomorphism classes.…
A threshold graph G on n vertices is defined by binary sequence of length n. In this paper we present an explicit formula for computing the characteristic polynomial of a threshold graph from its binary sequence. Applications include…
We develop an approach to noncommutative algebraic geometry ``in the perturbative regime" around ordinary commutative geometry. Let R be a noncommutative algebra and A=R/[R,R] its commutativization. We describe what should be the formal…
By consireding representation theory for non-associative algebras we construct the fundamental and adjoint representations of the octonion algebra. We then show how these representations by associative matrices allow a consistent octonionic…
For a hypergraph $\mathcal{H}=(X,\mathcal{E})$ a \emph{support} is a graph $G$ on $X$ such that for each $E\in\mathcal{E}$, the induced subgraph of $G$ on the elements in $E$ is connected. If $G$ is planar, we call it a planar support. A…