相关论文: Counting on rectangular areas
We prove an integral formula for continuous paths of rectangles inscribed in a piecewise smooth loop. We then use this integral formula to show that (with a very mild genericity hypothesis) the number of rectangle coincidences, informally…
This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…
Many questions about triangles and quadrilaterals with rational sides, diagonals and areas can be reduced to solving certain Diophantine equations. We look at a number of such questions including the question of approximating arbitrary…
We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…
It is shown that any subset $E$ of a plane over a finite field $\F_q$, of cardinality $|E|>q$ determines not less than $\frac{q-1}{2}$ distinct areas of triangles, moreover once can find such triangles sharing a common base. It is also…
A rectangular layout is a partition of a rectangle into a finite set of interior-disjoint rectangles. Rectangular layouts appear in various applications: as rectangular cartograms in cartography, as floorplans in building architecture and…
This article has been written for an educational magazine whose target audience consists of students and teachers of mathematics in universities, colleges and schools. It concerns a notion of duality between rectangles. A proof is given…
Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…
A wide variety of problems in combinatorics and discrete optimization depend on counting the set $S$ of integer points in a polytope, or in some more general object constructed via discrete geometry and first-order logic. We take a tour…
We present a complete computational classification of the combinatorial types of hyperplane sections, or slices, of the regular cube up to dimension six. For each dimension, we determine the exact number of distinct combinatorial types.…
In this paper we will do the following: (1) show how to geometrically define multiplication, using only basic plane geometry, independently of area and any notion of similar triangles; (2) prove all the properties of multiplication using…
We give a short proof of polynomial recurrence with large intersection for additive actions of finite-dimensional vector spaces over countable fields on probability spaces, improving upon the known size and structure of the set of strong…
In this note, we find a combinatorial identity which is closely related to the multi-dimensional integral $\gamma_{m}$ in the study of divisor functions. As an application, we determine the finite dual of the group algebra of infinite…
We study questions of existence and uniqueness of quadrature domains using computational tools from real algebraic geometry. These problems are transformed into questions about the number of solutions to an associated real semi-algebraic…
We lay the combinatorial foundations for [ShSt:340] by setting up and proving the essential properties of the coding apparatus for singular cardinals. We also prove another result concerning the coding apparatus for inaccessible cardinals.
In this paper, we consider a set of similar triangles with parallel sides, along with a set of points in the plane. It turns out that the set $\mathbb{R}_2= \{\pm <x >=\pm (x^2,x,1); x\in\mathbb{R} \}$ describes this set of triangles quite…
The pentagonal number theorem is extended to the sequence of the number of integer partitions with all parts equal. The new pentagonal number theorem implies that the distribution of the primes is just a specific detail of the application…
In this paper we develop in detail the geometric constructions that lead to many uniqueness results for the determination of polyhedral sets, typically scatterers, by a finite minimal number of measurements. We highlight how unique…
We use the hook lengths of a partition to define two rectangular tableaux. We prove these tableaux have equal multisets of entries, first by elementary combinatorial arguments, and then using Stanley's Hook Content Formula and symmetric…
We study the modular representation theory of the symmetric and alternating groups. One of the most natural ways to label the irreducible representations of a given group or algebra in the modular case is to show the unitriangularity of the…