Related papers: Generalized point configurations in ${\mathbb F}_q…
A subset of vertices of a graph $G$ is a general position set if no triple of vertices from the set lie on a common shortest path in $G$. In this paper we introduce the general position polynomial as $\sum_{i \geq 0} a_i x^i$, where $a_i$…
In this paper, we consider the lengths of cycles that can be embedded on the edges of the generalized pancake graphs which are the Cayley graph of the generalized symmetric group $S(m,n)$, generated by prefix reversals. The generalized…
We introduce a general theory of parametrized objects in the setting of infinity categories. Although spaces and spectra parametrized over spaces are the most familiar examples, we establish our theory in the generality of objects of a…
In this paper we present a new Good Characterization of maximum genus of a graph which makes a common generalization of the works of Xuong, Liu, and Fu et al. Based on this, we find a new polynomially bounded algorithm to find the maximum…
This paper studies thresholds in random generalized Johnson graphs for containing large cycles, i.e. cycles of variable length growing with the size of the graph. Thresholds are obtained for different growth rates.
The notion of symmetry in polynomial rings with several indeterminates is generalized to polynomial rings over finite fields. Families of extensions of the projective line over a finite field of constants possessing this property are…
We propose a covariant and geometric framework to introduce space distances as they are used by astronomers. In particular, we extend the definition of space distances from the one used between events to non-test-bodies with horizons and…
The Frechet distance is often used to measure distances between paths, with applications in areas ranging from map matching to GPS trajectory analysis to handwriting recognition. More recently, the Frechet distance has been generalized to a…
In this paper, we study conditions for the existence of an embedding $\widetilde{f} \colon P \to Q \times \mathbb{R}$ such that $f = \mathrm{pr}_Q \circ \widetilde{f}$, where $f \colon P \to Q$ is a piecewise linear map between polyhedra.…
We generalized the conventional concept of q-plate, allowing in its definition non linear functions of the azimuthal coordinate, and simulated the resulting fields of applying this kind of element to uniformly polarized input beams, both in…
The existence of a primitive element of $GF(q)$ with certain properties is used to prove that all cycles that could theoretically be embedded in $AG(2,q)$ and $PG(2,q)$ can, in fact, be embedded there (i.e. these planes are `pancyclic'). We…
The aim of this book is to show that the use of f-analytic families of finite type cycles (cycles having finitely many irreducible components, but not compact in general) in a given complex space may be useful in complex geometry, despite…
Generalized Functions play a central role in the understanding of differential equations containing singularities and nonlinearities. Introducing infinitesimals and infinities to deal with these obstructions leads to controversies…
Given a continuous function $f:[a,b]\to\mathbb{R}$ such that $f(a)=f(b)$, we investigate the set of distances $|x-y|$ where $f(x)=f(y)$. In particular, we show that the only distances this set must contain are ones which evenly divide…
We establish maximal trees and graphs for the difference of average distance and proximity proving thus the corresponding conjecture posed in [4]. We also establish maximal trees for the difference of average eccentricity and remoteness and…
For $S \subseteq \mathbb{R}$, positive integer $n$, and $d > 0$, let $G(S^n, d)$ be the graph whose vertex set is $S^n$ where any two vertices are adjacent if and only if they are Euclidean distance $d$ apart. The primary question we will…
Circuits play a fundamental role in polyhedral theory and linear programming. For instance, circuits are used as step directions in various augmentation schemes for solving linear programs or to leave degenerate vertices while running the…
We prove a uniform version of the Dynamical Mordell-Lang Conjecture for \'etale maps; also, we obtain a gap result for the growth rate of heights of points in an orbit along an arbitrary endomorphism of a quasiprojective variety defined…
A graph is \emph{$(\mathcal{I}, \mathcal{F})$-partitionable} if its vertex set can be partitioned into two parts such that one part $\mathcal{I}$ is an independent set, and the other $\mathcal{F}$ induces a forest. A graph is…
In this paper, we deal with a generalization $\Gamma(\Omega,q)$ of the bipartite graphs $D(k,q)$ proposed by Lazebnik and Ustimenko, where $\Omega$ is a set of binary sequences that are adopted to index the entries of the vertices. A few…