Related papers: On Landsberg's criterion for complete intersection…
In this article we introduce and study the intersection graph of graded ideals of graded rings. The intersection graph of $G-$graded ideals of a graded ring $(R,G)$ is a simple graph, denoted by $Gr_G(R)$, whose vertices are the nontrivial…
I prove a mass transference principle for general shapes, similar to a recent result by H. Koivusalo and M. Rams. The proof relies on Vitali's covering lemma and manipulations with Riesz energies. The main novelty is that it is proved that…
One of the driving motivations to develop $\F_1$-geometry is the hope to translate Weil's proof of the Riemann hypothesis from positive characteristics to number fields, which might result in a proof of the classical Riemann hypothesis. The…
Transportation distances have been used for more than a decade now in machine learning to compare histograms of features. They have one parameter: the ground metric, which can be any metric between the features themselves. As is the case…
In this note is we exhibit an elementary method to construct explicitly curves over finite fields with many points. Despite its elementary character the method is very efficient and can be regarded as a partial substitute for the use of…
In this paper we present a combinatorial proof of Selberg's integral formula. We start by giving a bijective proof of a Theorem about the number of topological orders of a certain related directed graph. Selberg's Integral Formula then…
The increasing wireless communication capabilities of vehicles creates opportunities for more efficient intersection management strategies. One promising approach is the replacement of traffic lights with a system wherein vehicles run…
Classical path search assumes complete graphs and scalar optimization metrics, yet real infrastructure networks are incomplete and require multi-dimensional evaluation. We introduce the concept of traversal: a generalization of paths that…
We give a syntactic characterization of abstract elementary classes (AECs) closed under intersections using a new logic with a quantifier for isomorphism types that we call structural logic: we prove that AECs with intersections correspond…
We show that each perfect matching in a bipartite graph $G$ intersects at least half of the perfect matchings in $G$. This result has equivalent formulations in terms of the permanent of the adjacency matrix of a graph, and in terms of…
In this paper, we prove that the Stanley--Reisner ideal of any connected simplicial complex of dimension $\ge 2$ that is locally complete intersection is a complete intersection ideal. As an application, we show that the Stanley--Reisner…
We study the complete intersection property and the algebraic invariants (index of regularity, degree) of vanishing ideals on degenerate tori over finite fields. We establish a correspondence between vanishing ideals and toric ideals…
The first contribution of this paper is architecture of a multipurpose system, which delegates a range of object detection tasks to a classifier, applied in special grid positions of the tested image. The second contribution is Gray…
In this paper we generalize the Ball-Collision Algorithm by Bernstein, Lange, Peters from the binary field to a general finite field. We also provide a complexity analysis and compare the asymptotic complexity to other generalized…
Extending a notion defined for surjective maps by Blanco, Majadas, and Rodicio, we introduce and study a class of homomorphisms of commutative noetherian rings, which strictly contains the class of locally complete intersection…
The aim of the paper is to characterize (pre)compactness in the spaces of Lipschitz/H\"older continuous mappings acting from a compact metric space to a normed space. To this end some extensions and generalizations of already existing…
For the planar $N$-body problem, we first introduce a class of moving frame suitable for orbits near central configurations, especially for total collision orbits, which is the main new ingredient of this paper. The moving frame allows us…
Hilbert's 15th problem called for a rigorous foundation of Schubert's calculus, in which a long standing and challenging part is Schubert's problem of characteristics. In the course of securing the foundation of algebraic geometry, Van der…
We present a criterion for the existence of telescopers for mixed hypergeometric terms, which is based on multiplicative and additive decompositions. The criterion enables us to determine the termination of Zeilberger's algorithms for mixed…
We give a simple direct proof of the Jamiolkowski criterion to check whether a linear map between matrix algebras is completely positive or not. This proof is more accesible for physicists than others found in the literature and provides a…