Results 21 to 30 of about 227,472 (209)

On the symmetric square. Unit elements [PDF]

open access: yesPacific Journal of Mathematics, 1996
\textit{J.-L. Waldspurger}'s recent coherence result [Publ. Math., Inst. Hautes Etud. Sci. 81, 25-72 (1995; Zbl 0841.22009)] for the germ expansion of the orbital integral of the unit element in the Hecke algebra on the topologically unipotent set, and Kazhdan's decomposition of compact elements into topologically unipotent and absolutely semi-simple ...
openaire   +3 more sources

Translative Packing of Unit Squares Into Equilateral Triangles Some New Results On Information Transmission Over Noisy Channels

open access: yesDemonstratio Mathematica, 2015
Every collection of n (arbitrary-oriented) unit squares can be packed translatively into any equilateral triangle of side length 2:3755· √n.
Januszewski Janusz
doaj   +1 more source

Packing Unit Squares in a Rectangle [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2005
For a positive integer $N$, let $s(N)$ be the side length of the minimum square into which $N$ unit squares can be packed. This paper shows that, for given real numbers $a,b\geq 2$, no more than $ab -(a+1-\lceil a\rceil) -(b+1-\lceil b\rceil)$ unit squares can be packed in any $a'\times b'$ rectangle $R$ with $a' < a$ and $b' < b$. From this, we
openaire   +2 more sources

Effective area calculation of pressure balances by means of dimensional measurements method

open access: yesMeasurement: Sensors, 2021
In this study, a piston-cylinder unit that has 980 mm2 effective area was calibrated by means of the dimensional measurement method. In addition, the cross-floating experiment was conducted to determine the effective area of the same piston-cylinder unit,
A. Türk, M. Aksulu, İ. Meral
doaj   +1 more source

A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares [PDF]

open access: yes, 2016
We give a polynomial-time approximation scheme for the unique unit-square coverage problem: given a set of points and a set of axis-parallel unit squares, both in the plane, we wish to find a subset of squares that maximizes the number of points ...
Ito, Takehiro   +6 more
core   +1 more source

Attractiveness of Central Public Spaces in Small Polish Towns Based on a Spatial Order Analysis

open access: yesLand, 2021
The purpose of this article is to evaluate the attractiveness of centrally located public spaces (main squares) in select new small towns in Poland. The evaluation was conducted from the spatial order perspective.
Wioletta Kamińska, Mirosław Mularczyk
doaj   +1 more source

Unit squares intersecting all secants of a square [PDF]

open access: yesDiscrete & Computational Geometry, 1994
Let S be a square of side length s > 0. We construct, for any sufficiently large s, a set of less than 1.994 s closed unit squares whose sides are parallel to those of S such that any straight line intersecting S intersects at least one square of S. It disproves L.
openaire   +2 more sources

5-Cyclohexyl-3-cyclohexylsulfonyl-2-methyl-1-benzofuran

open access: yesActa Crystallographica Section E, 2011
In the title compound, C21H28O3S, the benzofuran unit is essentially planar, with a mean deviation of 0.016&#8197;(1)&#8197;&#197; from the least-squares plane defined by the nine constituent atoms.
Hong Dae Choi   +3 more
doaj   +1 more source

Optimal Packings of 13 and 46 Unit Squares in a Square [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2010
Let $s(n)$ be the side length of the smallest square into which $n$ non-overlapping unit squares can be packed. We show that $s(m^2-3)=m$ for $m=4,7$, implying that the most efficient packings of 13 and 46 squares are the trivial ones.
openaire   +2 more sources

Packing, hitting, and colouring squares

open access: yesJournal of Computational Geometry
Given a family of squares in the plane, the packing problem asks for the maximum number $\nu$ of pairwise disjoint squares among them, while the hitting problem asks for the minimum number $\tau$ of points hitting all of them.
Marco Caoduro, András Sebő
doaj   +1 more source

Home - About - Disclaimer - Privacy