Related papers: Generalized point configurations in ${\mathbb F}_q…
The study of the graph diameter of polytopes is a classical open problem in polyhedral geometry and the theory of linear optimization. In this paper we continue the investigation initiated in [4] by introducing a vast hierarchy of…
Vector fields with components which are generalized zero-forms are constructed. Inner products with generalized forms, Lie derivatives and Lie brackets are computed. The results are shown to generalize previously reported results for…
We prove a uniform version of non-Archimedean Yomdin-Gromov parametrizations in a definable context with algebraic Skolem functions in the residue field. The parametrization result allows us to bound the number of F_q[t]-points of bounded…
Non-invertible symmetries of a quantum field theory (QFT) are a natural generalization of unitary symmetries, but in which the product of operators does not satisfy a group multiplication law. We show that such symmetry operations on states…
We introduce the concept of distance ideals of graphs, which can be regarded as a generalization of the Smith normal form and the spectra of the distance matrix of a graph. We obtain a classification of the graphs with at most one trivial…
Let $S$ be a set of points in $\mathbb{R}^2$ contained in a circle and $P$ an unrestricted point set in $\mathbb{R}^2$. We prove the number of distinct distances between points in $S$ and points in $P$ is at least…
Consider a family of graphs having a fixed girth and a large size. We give an optimal lower asymptotic bound on the number of even cycles of any constant length, as the order of the graphs tends to infinity.
A notion of general manifolds is introduced. It covers all usual manifolds in mathematics. Essentially, it is a way how to get a bigger 'fibration' over a site which locally coincides with a given one. An enrichment with generalized…
We construct $N$-complexes of non completely antisymmetric irreducible tensor fields on $\mathbb R^D$ which generalize the usual complex $(N=2)$ of differential forms. Although, for $N\geq 3$, the generalized cohomology of these…
Many polynomial invariants are defined on graphs for encoding the combinatorial information and researching them algebraically. In this paper, we introduce the cycle polynomial and the path polynomial of directed graphs for counting cycles…
We survey foundational principles of Grothendieck's generalized spaces, including a critical glossary of the various, and often conflicting, terminological usages. Known results using generalized points support a fully pointwise notation…
We give a generalization of the geometric estimate used by Hart and the second author in their 2008 work on sums and products in finite fields. Their result concerned level sets of non-degenerate bilinear forms over finite fields, while in…
We prove an unconditional (but slightly weakened) version of the main result of our earlier paper with the same title, which was, starting from dimension $4$, conditional to the Lefschetz standard conjecture. Let $X$ be a variety with…
In this note, we introduce a family of bipartite graphs called path restricted ordered bipartite graphs and present it as an abstract generalization of some well known geometric graphs like unit distance graphs on convex point sets. In the…
In this article, we use $\lambda$-sequences to derive common fixed points for a family of self-mappings defined on a complete $G$-metric space. We imitate some existing techniques in our proofs and show that the tools emlyed can be used at…
A graph $H$ is an \emph{isometric} subgraph of $G$ if $d_H(u,v)= d_G(u,v)$, for every pair~$u,v\in V(H)$. A graph is \emph{distance preserving} if it has an isometric subgraph of every possible order. A graph is \emph{sequentially distance…
We construct N-complexes of non completely antisymmetric irreducible tensor fields on $\mathbb R^D$ generalizing thereby the usual complex (N=2) of differential forms. These complexes arise naturally in the description of higher spin gauge…
We introduce the notion of a "random basic walk" on an infinite graph, give numerous examples, list potential applications, and provide detailed comparisons between the random basic walk and existing generalizations of simple random walks.…
In this work, we study conditions for the existence of length-constrained path-cycle decompositions, that is, partitions of the edge set of a graph into paths and cycles of a given minimum length. Our main contribution is the…
Generalized differential forms are used in discussions of metric geometries and Einstein's vacuum field equations. Cartan's structure equations are generalized and applied. In particular flat generalized connections are associated with any…