Related papers: Counting on rectangular areas
This is a survey of recent developments in combinatorics. The goal is to give a big picture of its many interactions with other areas of mathematics, such as: group theory, representation theory, commutative algebra, geometry (including…
Finite automata were used to determine multiple addresses in number systems and to find topological properties of self-affine tiles and finite type fractals. We join these two lines of research by axiomatically defining automata which…
We introduce in this section an Algebraic and Combinatorial approach to the theory of Numbers. The approach rests on the observation that numbers can be identified with familiar combinatorial objects namely rooted trees, which we shall here…
We give a survey on the theory of representation-finite and certain minimal representation-infinite algebras.The main goals are the existence of multiplicative bases and of coverings with good properties. Both are attained via…
We give a rigorous formulation of the intuitive idea that a differentiable map should be thesame thing as a locally, or infinitesimally, linear map: just as a linear map respects the operations of addition and multiplication by scalars ina…
This paper studies the proof of Collatz conjecture for some set of sequence of odd numbers with infinite number of elements. These set generalized to the set which contains all positive odd integers. This extension assumed to be the proof…
By counting the numbers of periodic points of all periods for some interval maps, we obtain infinitely many new congruence identities in number theory.
The motivation of this work is to define cohomology classes in the space of knots that are both easy to find and to evaluate, by reducing the problem to simple linear algebra. We achieve this goal by defining a combinatorial graded cochain…
In this paper we look at the automorphisms of the multiplicative group of finite nearfields. We find partial results for the actual automorphism groups. We find counting techniques for the size of all finite nearfields. We then show that…
New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…
The Holant theorem is a powerful tool for studying the computational complexity of counting problems in the Holant framework. Due to the great expressiveness of the Holant framework, a converse to the Holant theorem would itself be a very…
This paper is a short introduction to orthogonal polynomials, both the general theory and some special classes. It ends with some remarks about the usage of computer algebra for this theory.
This paper provides an in-depth analysis of how computational algebraic geometry can be used to deal with the problem of counting and classifying $r\times s$ partial Latin rectangles based on $n$ symbols of a given size, shape, type or…
Vacillating tableaux are sequences of integer partitions that satisfy specific conditions. The concept of vacillating tableaux stems from the representation theory of the partition algebra and the combinatorial theory of crossings and…
We continue our study on counting irreducible polynomials over a finite field with prescribed coefficients. We set up a general combinatorial framework using generating functions with coefficients from a group algebra which is generated by…
It is proved that each of compact linear groups of one special type admits a polynomial factorization map onto a real vector space. More exactly, the group is supposed to be non-commutative one-dimensional and to have two connected…
This paper proves a corner occupying theorem for the two-dimensional integral rectangle packing problem, stating that if it is possible to orthogonally place n arbitrarily given integral rectangles into an integral rectangular container…
We prove some properties of positive polynomial mappings between Riesz spaces, using finite difference calculus. We establish the polynomial analogue of the classical result that positive, additive mappings are linear. And we prove a…
We construct a computable, computably categorical field of infinite transcendence degree over the rational numbers, using the Fermat polynomials and assorted results from algebraic geometry. We also show that this field has an intrinsically…
Adding a column of numbers produces "carries" along the way. We show that random digits produce a pattern of carries with a neat probabilistic description: the carries form a one-dependent determinantal point process. This makes it easy to…