相关论文: Counting on rectangular areas
Compact sets in constructive mathematics capture our intuition of what computable subsets of the plane (or any other complete metric space) ought to be. A good representation of compact sets provides an efficient means of creating and…
This paper attacks the following problem. We are given a large number $N$ of rectangles in the plane, each with horizontal and vertical sides, and also a number $r<N$. The given list of $N$ rectangles may contain duplicates. The problem is…
We attach a ring of sequences to each number from a certain class of extremal real numbers, and we study the properties of this ring both from an analytic point of view by exhibiting elements with specific behaviors, and also from an…
This paper introduced a way of fractal to solve the problem of taking count of the integer partitions, furthermore, using the method in this paper some recurrence equations concerning the integer partitions can be deduced, including the…
We count tilings of the $n \times m$ rectangular grid, cylinder, and torus with arbitrary tile sets up to arbitrary symmetries of the square and rectangle, along with cyclic shifting of rows and columns. This provides a unifying framework…
We estimate, in a number field, the number of elements and the maximal number of linearly independent elements, with prescribed bounds on their valuations. As a by-product, we obtain new bounds for the successive minima of ideal lattices.…
We develop a recursive formula for counting the number of rectangulations of a square, i.e the number of combinatorially distinct tilings of a square by rectangles. Our formula specializes to give a formula counting generic rectangulations,…
Some applications of a result, which is proved recently, is considered. We first prove three determinantal identities concerning the binomial coefficient and Stirling numbers of the first and the second kind. We also easily obtain the…
Computing modular coincidences can show whether a given substitution system, which is supported on a point lattice in R^d, consists of model sets or not. We prove the computatibility of this problem and determine an upper bound for the…
Recently Andrews and Bachraoui proved identities relating certain restricted partitions into distinct even parts with restricted 4-regular partitions by the theory of basic hypergeometric series. They also posed a question regarding…
We indicate a way of distinguishing between structures, for which, two structures are said to be separable.Being separable implies being non-isomorphic. We show that for any first order theory $T$ in a countable language, if it has an…
$ \newcommand{\Re}{\mathbb{R}} \newcommand{\reals}{\mathbb{R}} \newcommand{\SetX}{\mathsf{X}} \newcommand{\rad}{r} \newcommand{\Mh}[1]{#1} \newcommand{\query}{q} \newcommand{\eps}{\varepsilon} \newcommand{\VorX}[1]{\mathcal{V} \pth{#1}}…
We give characterizations of unital uniform topological algebras and saturated locally multiplicatively convex algebras by means of multiplicative linear functionals. Some automatic continuity theorems in advertibly complete uniform…
Pick's astonishing theorem explains how to obtain the area of any integer polygon by counting lattice points. It is a notoriously difficult challenge to translate the geometric statement and intuitive reasoning into a formal statement and…
We present a method for numerical computation of conformal mappings from simply or doubly connected domains onto so-called canonical domains, which in our case are rectangles or annuli. The method is based on conjugate harmonic functions…
To determine whether a number is congruent or not is an old and difficult topic and progress is slow. The paper presents a new theorem when a prime number is a congruent number or not. The proof is not necessarily any simpler or shorter…
Recently the second named author discovered a combinatorial identity in the context of vertex representations of quantum Kac-Moody algebras. We give a direct and elementary proof of this identity. Our method is to show a related identity of…
We define a counting function that is related to the binomial coefficients. An explicit formula for this function is proved. In some particular cases, simpler explicit formuls are derived. We also derive a formula for the number of…
The character table of the symmetric group $S_n$, of permutations of $n$ objects, is of fundamental interest in theoretical physics, combinatorics as well as computational complexity theory. We investigate the implications of an identity,…
Multiple harmonic-like numbers are studied using the generating function approach. A closed form is stated for binomial sums involving these numbers and two additional parameters. Several corollaries and examples are presented which are…