Results 1 to 10 of about 220,380 (165)

Translative Packing of Unit Squares into Squares

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2012
Every collection of n (arbitrary-oriented) unit squares admits a translative packing into any square of side length √2.5⋅𝑛.
Janusz Januszewski
doaj   +2 more sources

A polynomial algorithm for packing unit squares in a hypograph of a piecewise linear function

open access: yesOpen Engineering, 2017
We consider the problem of packing the maximal number of unit squares in a hypograph of a function. A polynomial time algorithm is described to solve this problem for a piecewise linear function.
Arslanov Marat   +2 more
doaj   +2 more sources

Covering Segments with Unit Squares [PDF]

open access: yesLecture Notes in Computer Science, 2017
We study several variations of line segment covering problem with axis-parallel unit squares in $I\!\!R^2$. A set $S$ of $n$ line segments is given. The objective is to find the minimum number of axis-parallel unit squares which cover at least one end-point of each segment. The variations depend on the orientation and length of the input segments.
Ankush Acharyya   +2 more
exaly   +3 more sources

Massively parallel least squares finite element method with graphic processing unit

open access: yesAdvances in Mechanical Engineering, 2017
For the reason of enormous computational expense, although the least squares finite element method has the advantages of high accuracy, robustness and strong versatility, the application of it is limited in computational fluid dynamics.
Qiliang Li   +4 more
doaj   +2 more sources

Global unit squares and local unit squares

open access: yesJournal of Number Theory, 2008
Let \(K\) be any Galois extension of \(\mathbb Q\), and \(U_K\) be the unit group of \(K\). For any place \(v\) of \(K\), let \(U_v\) be the group of local units of \(K_v\). Here the authors study the following problem: does there exist an odd prime \(p\) such that the map \(U_K/U_K^2\to \prod_{v\mid p} U_v/U_v^2\) is injective.
Xianke Zhang
exaly   +2 more sources

Efficient Packing of Unit Squares in a Square [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2002
Let $s(N)$ denote the edge length of the smallest square in which one can pack $N$ unit squares. A duality method is introduced to prove that $s(6)=s(7)=3$. Let $n_r$ be the smallest integer $n$ such that $s(n^2+1)\le n+{1/r}$. We use an explicit construction to show that $n_r\le 27r^3/2+O(r^2)$, and also that $n_2\le43$.
Michael J. Kearney, Peter Shiu
openaire   +2 more sources

Statistical Features and Estimation Methods for Half-Logistic Unit-Gompertz Type-I Model

open access: yesMathematics, 2023
In this study, we propose a new three-parameter lifetime model based on the type-I half-logistic G family and the unit-Gompertz model, which we named the half-logistic unit Gompertz type-I distribution.
Anum Shafiq   +4 more
doaj   +1 more source

Panel Cointegration Analysis of Total Environmental Taxes and Economic Growth in EU Countries

open access: yesEconomic Analysis, 2021
This paper examines the relationship between total environmental taxes and economic growth for twenty-eight EU countries from 1994 to 2018. The aim of this research is to evaluate the long-run relationship between these variables based on panel data ...
Vera Mirović   +2 more
doaj   +1 more source

Momentum Operators in the Unit Square [PDF]

open access: yesIntegral Equations and Operator Theory, 2013
We investigate the skew-adjoint extensions of a partial derivative operator acting in the direction of one of the sides a unit square. We investigate the unitary equivalence of such extensions and the spectra of such extensions. It follows from our results, that such extensions need not have discete spectrum.
Pedersen, Steen, Tian, Feng
openaire   +2 more sources

Improved Packings of $n(n − 1)$ Unit Squares in a Square [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2021
Let $s(n)$ be the side of the smallest square into which we can pack $n$ unit squares. The purpose of this paper is to prove that $s(n^2-n)<n$ for all $n\geq 12$. Besides, we show that $s(18^2-17) < 18, s(17^2-16) < 17,$ and $s(16^2-15) < 16.$
M. Z. Arslanov   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy