Related papers: Counting fixed-point-free Cayley permutations

In this paper, we examine some properties of the fixed point set of a digitally continuous function. The digital setting requires new methods that are not analogous to those of classical topological fixed point theory, and we obtain results…

We prove that the AdS/CFT calculation of 1-point functions can be drastically simplified by using variational arguments. We give a simple universal proof, valid for any theory that can be derived from a Lagrangian, that the large radius…

The winding number is a concept in complex analysis which has, in the presence of chiral symmetry, a physics interpretation as the topological index belonging to gapped phases of fermions. We study statistical properties of this topological…

Motivated by the recent developments on the complexity of non-com\-mu\-ta\-tive determinant and permanent [Chien et al.\ STOC 2011, Bl\"aser ICALP 2013, Gentry CCC 2014] we attempt at obtaining a tight characterization of hard instances of…

Let $S$ be a subset of a amenable group $G$ such that $e\in S$ and $S^{-1}=S$. The main result of the paper states that if the Cayley graph of $G$ with respect to $S$ has a certain combinatorial property, then every positive definite…

We use representation theory of the symmetric group S_n to prove Poisson limit theorems for the distribution of fixed points for three types of non-uniform permutations. First, we give results for the commutator of g and x where g and x are…

Efficiency of routing on a regular digraph often involves finding opitmal properties of the graph. For example, the diameter of a digraph is the maximum distance between any two vertices. We show how we can study these problems…

Due to their elegant and simple nature, unitary Cayley graphs have been an active research topic in the literature. These graphs are naturally connected to several branches of mathematics, including number theory, finite algebra,…

We are interested in various aspects of spectral rigidity of Cayley and Schreier graphs of finitely generated groups. For each pair of integers $d\geq 2$ and $m \ge 1$, we consider an uncountable family of groups of automorphisms of the…

We construct families of rational functions $f \colon \bP^1_k \to \bP^1_k$ of degree $d \geq 2$ over a perfect field $k$ whose associated fixed-point processes fail to be martingales. Conversely, for any normal variety $X \subset…

We consider a nonlocal differential equation of Kirchhoff type with a convolution coefficient involving variable growth. The novelty of our work lies in allowing a variable exponent in the nonlocal term. By relating the variable growth…

The study of fixed point ratios is a classical topic in permutation group theory, with a long history stretching back to the origins of the subject in the 19th century. Fixed point ratios arise naturally in many different contexts, finding…

In this paper, we present a method to obtain regular (or equitable) partitions of Cayley (di)graphs (that is, graphs, digraphs, or mixed graphs) of permutation groups on $n$ letters. We prove that every partition of the number $n$ gives…

In discrete contexts such as the degree distribution for a graph, \emph{scale-free} has traditionally been \emph{defined} to be \emph{power-law}. We propose a reasonable interpretation of \emph{scale-free}, namely, invariance under the…

We call $i$ a fixed point of a given sequence if the value of that sequence at the $i$-th position coincides with $i$. Here, we enumerate fixed points in the class of restricted growth sequences. The counting process is conducted by…

Let $k$ be a finite field extension of the function field $\bfF_p(T)$ and $\bar{k}$ its algebraic closure. We count points in projective space $\Bbb P ^{n-1}(\bar{k})$ with given height and of fixed degree $d$ over the field $k$. If…

We define a new family of generalized Stirling permutations that can be interpreted in terms of ordered trees and forests. We prove that the number of generalized Stirling permutations with a fixed number of ascents is given by a natural…

We establish a coupled fixed points theorem for a meaningful class of mixed monotone multivalued operators and then we use it to derive some results on existence of quasisolutions and solutions to first--order functional differential…

In this paper, we try to determine exact or bounds on the choosability, or list chromatic numbers of some Cayley graphs, typically some Unitary Cayley graphs and Cayley graphs on Dihedral groups.

We develop a fixed-point extension of quantitative equational logic and give semantics in one-bounded complete quantitative algebras. Unlike previous related work about fixed-points in metric spaces, we are working with the notion of…