Regressions and monotone chains: A ramsey-type extremal problem for partial orders

Aregression is a functiong from a partially ordered set to itself such thatg(x)≦x for allz. Amonotone k-chain is a chain ofk elementsx ₁<x ₂ <...<x _k such thatg(x ₁)≦g(x ₂)≦...≦g(x _k ). If a partial order has sufficiently many elements compared to the size of its largest antichain, every regression on it will have a monotone (k + 1)-chain. Fixingw, letf(w, k) be the smallest number such that every regression on every partial order with size leastf(w, k) but no antichain larger thanw has a monotone (k + 1)-chain. We show thatf(w, k)=(w+1) ^k . Dedicated to Paul Erdős on his seventieth birthday Research supported in part by the National Science Foundation under ISP-80-11451.     

Oscillation inequalities for rectangles

In this paper we extend previously obtained results on norm inequalities for square functions, oscillation and variation operators, with actions, to the case of actions. The technique involves the use of a result about vector valued maximal functions, due to Fefferman and Stein, to reduce the problem to a situation where we can apply our previous results.     

Optimal spanners for axis-aligned rectangles

The dilation of a geometric graph is the maximum, over all pairs of points in the graph, of the ratio of the Euclidean length of the shortest path between them in the graph and their Euclidean distance. We consider a generalized version of this notion, where the nodes of the graph are not points but axis-parallel rectangles in the plane. The arcs in the graph are horizontal or vertical segments connecting a pair of rectangles, and the distance measure we use is the $L_1$-distance. The dilation of a pair of points is then defined as the length of the shortest rectilinear path between them that stays within the union of the rectangles and the connecting segments, divided by their $L_1$-distance. The dilation of the graph is the maximum dilation over all pairs of points in the union of the rectangles.We study the following problem: given n non-intersecting rectangles and a graph describing which pairs of rectangles are to be connected, we wish to place the connecting segments such that the dilation is minimized. We obtain four results on this problem: (i) for arbitrary graphs, the problem is NP-hard; (ii) for trees, we can solve the problem by linear programming on $\mathrm{O}(n^2)$ variables and constraints; (iii) for paths, we can solve the problem in time $\mathrm{O}(n^3\log n)$; (iv) for rectangles sorted vertically along a path, the problem can be solved in $\mathrm{O}(n^2)$ time, and a $(1+\varepsilon )$-approximation can be computed in linear time.     

Nearly magic rectangles

Magic squares have been extremely useful and popular in combinatorics and statistics. One generalization of magic squares is magic rectangles which are useful for designing experiments in statistics. A necessary and sufficient condition for the existence of magic rectangles restricts the number of rows and columns to be either both odd or both even. In this paper, we generalize magic rectangles to even by odd nearly magic rectangles. We also prove necessary and sufficient conditions for the existence of a nearly magic rectangle, and construct one for each parameter set for which they exist.     

A Gauss-Seidel iteration method for nonlinear variational inequality problems over rectangles

This paper presents a simple yet practically useful Gauss-Seidel iterative method for solving a class of nonlinear variational inequality problems over rectangles and of nonlinear complementarity problems. This scheme is a nonlinear generalization of a robust iterative method for linear complementarity problems developed by Mangasarian. Global convergence is presented for problems with Z-functions. It is noted that the suggested method can be viewed as a specific case of a class of linear approximation methods studied by Pang and others.     

Packing random rectangles

A random rectangle is the product of two independent random intervals, each being the interval between two random points drawn independently and uniformly from [0,1]. We prove that te number C _n of items in a maximum cardinality disjoint subset of n random rectangles satisfies

A new quadratic nonconforming finite element on rectangles

A new quadratic nonconforming finite element on rectangles (or parallelograms) is introduced. The nonconforming element consists of P₂ ⊕ Span{x²y,xy²} on a rectangle and eight degrees of freedom. Our element is essentially of seven degrees of freedom since the degree of freedom associated with the integration on rectangle is essentially of bubble‐function nature. Global basis functions are constructed for both Dirichlet and Neumann type of problems; accordingly the corresponding dimensions are counted. The local and global interpolation operators are defined. Error estimates of optimal order are derived in both broken energy and L²(Ω) norms for second‐order of elliptic problems. Brief numerical results are also shown to confirm the optimality of the presented quadratic nonconforming element. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

Double Aztec rectangles

We investigate the connection between lozenge tilings and domino tilings by introducing a new family of regions obtained by attaching two different Aztec rectangles. We prove a simple product formula for the generating functions of the tilings of the new regions, which involves the statistics as in the Aztec diamond theorem (Elkies et al. (1992) [2], [3]). Moreover, we consider the connection between the generating function and MacMahon's q-enumeration of plane partitions fitting in a given box     

Coloring axis-parallel rectangles

For every k and r, we construct a finite family of axis-parallel rectangles in the plane such that no matter how we color them with k colors, there exists a point covered by precisely r members of the family, all of which have the same color. For r=2, this answers a question of S. Smorodinsky [S. Smorodinsky, On the chromatic number of some geometric hypergraphs, SIAM J. Discrete Math. 21 (2007) 676-687].     

A new cubic nonconforming finite element on rectangles

A new nonconforming rectangle element with cubic convergence for the energy norm is introduced. The degrees of freedom (DOFs) are defined by the 12 values at the three Gauss points on each of the four edges. Due to the existence of one linear relation among the above DOFs, it turns out the DOFs are 11. The nonconforming element consists of . We count the corresponding dimension for Dirichlet and Neumann boundary value problems of second‐order elliptic problems. We also present the optimal error estimates in both broken energy and norms. Finally, numerical examples match our theoretical results very well. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 691–705, 2015     

Simplest optimal cutting patterns for equal rectangles

This paper presents branch-and-bound algorithms that can guarantee the simplest optimal cutting patterns of equal rectangles. An existing linear algorithm determines the global upper bound exactly. The branching process ends when a branch of a lower bound equal to the global upper bound is found.     

A generalization of Riordan''s formula for 3xn latin rectangles

A formula is obtained for the number of three-line latin rectangles with first row normalized and second row a permutation which, in disjoint cycle form, has no cycles of prescribed lengths.     

An optimal contour algorithm for iso-oriented rectangles

Given a set of n iso-oriented rectangles in 2-space we describe an algorithm which determines the contour of their union in O(n log n + p) time and O(n + p) space, where p is the number of edges in the contour. This performance is time-optimal. The space requirements are the same as in the best previously known algorithm. We achieve this by introducing a new data structure, the contracted segment tree, which is a non-trivial modification of the well known segment tree. If only the pieces of the contour are to be reported then this approach yields a time- and space-optimal algorithm.     

A relative bound for independence

We prove an upper bound for the independence number of a graph in terms of the largest Laplacian eigenvalue, and of a certain induced subgraph. Our bound is a refinement of a well-known Hoffman-type bound.     

A lower bound for n-diameters

Let D be a subset of the s-dimensional lattice Z^S, M=M(D) the number of elements in D, _Dthe space of trigonometric polynomials on the torus T^S with spectrum concentrated in D and having unit norm in L₂(T^S). In this paper we give the following bound for the Gel'fand diameter:d ⁿ( _D,C(T^s))M/2–N/2. This bound is subsequently used for actual functional classes.Translated from Matematicheskie Zametki, Vol. 12, No. 4, pp. 413–419, October, 1972.     

A bound for tridiagonal matrices

Novosibirsk. Translated from Sibirskii Matematicheskii Zhurnal, Vol. 30, No. 4, pp. 171–173, July–August, 1989.     

Mining maximal frequent rectangles

Advances in Data Analysis and Classification - Interval data, a special case of symbolic data, are becoming more frequent in different fields of applications due to the uncertainty in the...