Semigroups of non-negative integer-valued matrices

2021 ◽  
pp. 1-21
Author(s):  
N. R. Baeth ◽  
H. Chen ◽  
G. Heilbrunn ◽  
R. Liu ◽  
M. Young
Keyword(s):  
2021 ◽  
Vol 96 ◽  
pp. 545-558
Author(s):  
Paulo Roberto Prezotti Filho ◽  
Valderio Anselmo Reisen ◽  
Pascal Bondon ◽  
Márton Ispány ◽  
Milena Machado Melo ◽  
...  

2016 ◽  
Vol 10 (8) ◽  
pp. 936-946 ◽  
Author(s):  
Mahdi Hatam ◽  
Mohammad Ali Masnadi‐Shirazi

10.37236/115 ◽  
2009 ◽  
Vol 16 (1) ◽  
Author(s):  
Norbert Seifter ◽  
Vladimir I. Trofimov

In this paper we investigate reachability relations on the vertices of digraphs. If $W$ is a walk in a digraph $D$, then the height of $W$ is equal to the number of edges traversed in the direction coinciding with their orientation, minus the number of edges traversed opposite to their orientation. Two vertices $u,v\in V(D)$ are $R_{a,b}$-related if there exists a walk of height $0$ between $u$ and $v$ such that the height of every subwalk of $W$, starting at $u$, is contained in the interval $[a,b]$, where $a$ ia a non-positive integer or $a=-\infty$ and $b$ is a non-negative integer or $b=\infty$. Of course the relations $R_{a,b}$ are equivalence relations on $V(D)$. Factorising digraphs by $R_{a,\infty}$ and $R_{-\infty,b}$, respectively, we can only obtain a few different digraphs. Depending upon these factor graphs with respect to $R_{-\infty,b}$ and $R_{a,\infty}$ it is possible to define five different "basic relation-properties" for $R_{-\infty,b}$ and $R_{a,\infty}$, respectively. Besides proving general properties of the relations $R_{a,b}$, we investigate the question which of the "basic relation-properties" with respect to $R_{-\infty,b}$ and $R_{a,\infty}$ can occur simultaneously in locally finite connected transitive digraphs. Furthermore we investigate these properties for some particular subclasses of locally finite connected transitive digraphs such as Cayley digraphs, digraphs with one, with two or with infinitely many ends, digraphs containing or not containing certain directed subtrees, and highly arc transitive digraphs.


2007 ◽  
Vol 143 (6) ◽  
pp. 1493-1510 ◽  
Author(s):  
Takehiko Yasuda

AbstractFor each non-negative integer n we define the nth Nash blowup of an algebraic variety, and call them all higher Nash blowups. When n=1, it coincides with the classical Nash blowup. We study higher Nash blowups of curves in detail and prove that any curve in characteristic zero can be desingularized by its nth Nash blowup with n large enough. Moreover, we completely determine for which n the nth Nash blowup of an analytically irreducible curve singularity in characteristic zero is normal, in terms of the associated numerical monoid.


2013 ◽  
Vol 09 (08) ◽  
pp. 1973-1993 ◽  
Author(s):  
SHINJI FUKUHARA ◽  
YIFAN YANG

We find a basis for the space Sk(Γ1(4)) of cusp forms of weight k for the congruence subgroup Γ1(4) in terms of Eisenstein series. As an application, we obtain formulas for r2k(n), the number of ways to represent a non-negative integer n as sums of 2k integer squares.


1981 ◽  
Vol 22 (1) ◽  
pp. 101-118 ◽  
Author(s):  
W. W. Stothers

Let H be a subgroup of Γ, the modular group. Let h be the number of orbits of under the action of H. In each orbit, the stabilizers are H-conjugate. Let U be the mapping z↦z + 1. Each stabilizer is Γ-conjugate to 〈Uc〉 for some non-negative integer c. The integer c is the cusp-width of the orbit. Let h0 be the number of orbits with non-trivial stabilizer, i.e. with c>0. The sequence (c(1), …, c(h0)) of non-zero cuspwidths is the cusp-split of H. Clearly, h0<h, and h∞ = h−h0 is the number of orbits with trivial stabilizer.


Author(s):  
Robin Flowerdew

Most statistical analysis is based on the assumption that error is normally distributed, but many data sets are based on discrete data (the number of migrants from one place to another must be a whole number). Recent developments in statistics have often involved generalising methods so that they can be properly applied to non-normal data. For example, Nelder and Wedderburn (1972) developed the theory of generalised linear modelling, where the dependent or response variable can take a variety of different probability distributions linked in one of several possible ways to a linear predictor, based on a combination of independent or explanatory variables. Several common statistical techniques are special cases of the generalised linear models, including the usual form of regression analysis, Ordinary Least Squares regression, and binomial logit modelling. Another important special case is Poisson regression, which has a Poisson-distributed dependent variable, linked logarithmically to a linear combination of independent variables. Poisson regression may be an appropriate method when the dependent variable is constrained to be a non-negative integer, usually a count of the number of events in certain categories. It assumes that each event is independent of the others, though the probability of an event may be linked to available explanatory variables. This chapter illustrates how Poisson regression can be carried out using the Stata package, proceeding to discuss various problems and issues which may arise in the use of the method. The number of migrants from area i to area j must be a non-negative integer and is likely to vary according to zone population, distance and economic variables. The availability of high-quality migration data through the WICID facility permits detailed analysis at levels from the region to the output areas. A vast range of possible explanatory variables can also be derived from the 2001 Census data. Model results are discussed in terms of the significant explanatory variables, the overall goodness of fit and the big residuals. Comparisons are drawn with other analytic techniques such as OLS regression. The relationship to Wilson’s entropy maximising methods is described, and variants on the method are explained. These include negative binomial regression and zero-censored and zero-truncated models.


Sign in / Sign up

Export Citation Format

Share Document