English
Related papers

Related papers: The multiplicative inequality for class degrees vi…

200 papers

This paper focuses on the problem of the degree sequence for a mixed random graph process which continuously combines the {\it classical} model and the BA model. Note that the number of step added edges for the mixed model is random and…

Probability · Mathematics 2009-01-13 Xian-Yuan Wu , Zhao Dong , Ke Liu , Kai-Yuan Cai

We discuss several enumerative results for irreducible polynomials of a given degree and pairs of relatively prime polynomials of given degrees in several variables over finite fields. Two notions of degree, the {\em total degree} and the…

Number Theory · Mathematics 2008-11-26 Xiang-dong Hou , Gary L. Mullen

We investigate what happens when we try to work with continuing block codes (i.e. left or right continuing factor maps) between shift spaces that may not be shifts of finite type. For example, we demonstrate that continuing block codes on…

Dynamical Systems · Mathematics 2014-10-28 Jisang Yoo

Given an irreducible sofic shift X, we show that an an irreducible SFT Y of lower entropy is a factor of X if and only if it is a factor of X by an open bi-continuing code. If these equivalent conditions hold and Y is mixing, then any code…

Dynamical Systems · Mathematics 2013-11-26 Uijin Jung

The present paper is a note on the tensor degree of finite groups, introduced recently in literature. This numerical invariant generalizes the commutativity degree through the notion of nonabelian tensor square. We show two inequalities,…

Group Theory · Mathematics 2015-09-09 Ahmad M. A. Alghamdi , Francesco G. Russo

For real factors the notions of the coupling constant and the index are introduced and investigated. The possible values of the index for type II$_1$ real factors are calculated, in a similar way as for the complex case.

Operator Algebras · Mathematics 2009-02-09 S. Albeverio , Sh. A. Ayupov , A. A. Rakhimov , R. A. Dadakhodjaev

Multi-valued functions are common in computable analysis (built upon the Type 2 Theory of Effectivity), and have made an appearance in complexity theory under the moniker search problems leading to complexity classes such as PPAD and PLS…

Computational Complexity · Computer Science 2015-12-31 Arno Pauly

Multilevel methods are among the most efficient numerical methods for solving large-scale systems of equations that arise from discretized partial differential equations. Two-level convergence theory plays a fundamental role in the analysis…

Numerical Analysis · Mathematics 2025-06-04 Xuefeng Xu

We extend the 2-representation theory of finitary 2-categories to certain 2-categories with infinitely many objects, denoted locally finitary 2-categories, and extend the classical classification results of simple transitive…

Category Theory · Mathematics 2022-01-19 James Macpherson

We prove that a knowledge of the character degrees of a finite group G and of their multiplicities determines whether G has a Sylow p-subgroup as a direct factor. An analogous result based on a knowledge of the conjugacy class sizes was…

Group Theory · Mathematics 2007-05-23 Sandro Mattarei

We introduce the notion of quantum duplicates of an (associative, unital) algebra, motivated by the problem of constructing toy-models for quantizations of certain configuration spaces in quantum mechanics. The proposed (algebraic) model…

Quantum Algebra · Mathematics 2014-02-26 Óscar Cortadellas , Javier López Peña , Gabriel Navarro

If the $n-th$ order differential equation is not exact, under certain conditions, an integrating factor exists which transforms the differential equation into an exact one. Hence, its order can be reduced to the lower order. In this paper,…

Classical Analysis and ODEs · Mathematics 2017-11-23 Mohammadkheer Al-Jararha

We classify certain sofic shifts (the irreducible Point Extension Type, or PET, sofic shifts) up to flow equivalence, using invariants of the canonical Fischer cover. There are two main ingredients: (1) An extension theorem, for extending…

Dynamical Systems · Mathematics 2018-10-08 Mike Boyle , Toke Meier Carlsen , Søren Eilers

We study finiteness (and vanishing) properties of the higher order degrees associated to complements of complex affine plane curves with mild singularities at infinity. Our results impose new obstructions on the class of groups that can be…

Algebraic Topology · Mathematics 2018-08-10 Eva Elduque , Laurentiu Maxim

We introduce a reducibility on classes of structures, essentially a uniform enumeration reducibility. This reducibility is inspired by the Friedman-Stanley paper on using Borel reductions to compare classes of countable structures. This…

Logic · Mathematics 2008-03-25 Wesley Calvert , Desmond Cummins , Sara Miller , Julia F. Knight

We give an explicit upper bound for the number of equivalence classes of binary forms with rational integral coefficients of given degree and given discriminant, and with given splitting field. Further, we give an explicit upper bound for…

Number Theory · Mathematics 2015-06-26 Attila Berczes , Jan-Hendrik Evertse , Kalman Gyory

The commutativity degree of a finite group is the probability that two randomly chosen group elements commute. The main object of this paper is to obtain a characterization for all finite groups of odd order with commutativity degree…

Group Theory · Mathematics 2011-04-01 Ashish Kumar Das , Rajat Kanti Nath

We define a notion of (one-sided) shift spaces over infinite alphabets. Unlike many previous approaches to shift spaces over countable alphabets, our shift spaces are compact Hausdorff spaces. We examine shift morphisms between these shift…

Operator Algebras · Mathematics 2013-07-03 William Ott , Mark Tomforde , Paulette Willis

We consider maps between commutative groups and their functional degrees. These degrees are defined based on a simple idea -- the functional degree should decrease if a discrete derivative is taken. We show that the maps of finite…

Group Theory · Mathematics 2021-06-28 Uwe Schauz

In this paper, we introduce a new concept namely degree polynomial for vertices of a simple graph. This notion leads to a concept namely degree polynomial sequence which is stronger than the concept of degree sequence. After obtaining the…

Combinatorics · Mathematics 2020-09-02 Reza Jafarpour-Golzari