Related papers: Computing degree and class degree
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…
The 2-switch-degree of $G$ is the number of distinct 2-switches acting on a graph $G$. In this work we study structural properties of the 2-switch-degree, with a focus on split graphs. Our approach is motivated by the Tyshkevich…
A genus one curve of degree 5 is defined by the 4 x 4 Pfaffians of a 5 x 5 alternating matrix of linear forms on P^4. We describe a general method for investigating the invariant theory of such models. We use it to explain how we found our…
In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…
We consider a probabilistic approach to compute the Wiener--Young $\Phi$-variation of fractal functions in the Takagi class. Here, the $\Phi$-variation is understood as a generalization of the quadratic variation or, more generally, the…
The dynamics of symbolic systems, such as multidimensional subshifts of finite type or cellular automata, are known to be closely related to computability theory. In particular, the appropriate tools to describe and classify topological…
Recently, two first authors have introduced a group invariant, which is related to the number of elements $x$ and $y$ of a finite group $G$ such that $x\wedge y=1$ in the exterior square $G\wedge G$ of $G$. Research on this probability…
We provide a closed formula for the degree of $\text{SO}(n)$ over an algebraically closed field of characteristic zero. In addition, we describe symbolic and numerical techniques which can also be used to compute the degree of…
In this paper, we introduce the commutativity degree of a finite-dimensional Lie algebra over a finite field and determine upper and lower bounds for it. Moreover, we study some relations between the notion of commutativity degree and known…
The classical Fourier transform is, in essence, a way to take data and extract components (in the form of complex exponentials) which are invariant under cyclic shifts. We consider a case in which the components must instead be invariant…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
Second-order polynomials generalize classical first-order ones in allowing for additional variables that range over functions rather than values. We are motivated by their applications in higher-order computational complexity theory,…
Richter, Stephan, and Zhang asked whether every nonrecursive many-one degree contains a least finite-one degree. We solve this question in the negative, already within the class of computably enumerable many-one degrees. Positive answers…
We define the equivariant degree and local degree of a proper $G$-equivariant map between smooth $G$-manifolds when $G$ is a compact Lie group and prove a local to global result. We show the local degree can be used to compute the…
Topological indices have been used to modeling biological and chemical properties of molecules in quantitive structure property relationship studies and quantitive structure activity studies. All the degree based topological indices have…
We show that the degree of a graded lattice ideal of dimension 1 is the order of the torsion subgroup of the quotient group of the lattice. This gives an efficient method to compute the degree of this type of lattice ideals.
A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the…
The essential variety is an algebraic subvariety of dimension $5$ in real projective space $\mathbb R\mathrm P^{8}$ which encodes the relative pose of two calibrated pinhole cameras. The $5$-point algorithm in computer vision computes the…
A sequence of nonnegative integers $\pi$ is {\it graphic} if it is the degree sequence of some graph $G$. In this case we say that $G$ is a \textit{realization} of $\pi$, and we write $\pi=\pi(G)$. A graphic sequence $\pi$ is {\it…
Every computable function has to be continuous. To develop computability theory of discontinuous functions, we study low levels of the arithmetical hierarchy of nonuniformly computable functions on Baire space. First, we classify…