English
Related papers

Related papers: Broken bricks and the pick-up sticks problem

200 papers

This paper proves several weak limit theorems for the joint version of extreme order statistics and partial sums of independently and identically distributed random variables. The results are also extended to almost sure limit version.

Probability · Mathematics 2023-12-18 Gaoyu Li , Zhongquan Tan

We study possibilities for semantic and syntactic rigidity, i.e., the rigidity with respect to automorphism group and with respect to definable closure. Variations of rigidity and their degrees are studied in general case, for special…

Logic · Mathematics 2023-07-26 Sergey V. Sudoplatov

A fork stack is a generalised stack which allows pushes and pops of several items at a time. We consider the problem of determining which input streams can be sorted using a single forkstack, or dually, which permutations of a fixed input…

Discrete Mathematics · Computer Science 2007-05-23 M. H. Albert , M. D. Atkinson

We study the obstacle problem associated with the American chooser option. The obstacle is given by the maximum of an American call option and an American put option, which, in turn, can be expressed as the maximum of the solutions to the…

Analysis of PDEs · Mathematics 2026-03-18 Gugyum Ha , Junkee Jeon , Jihoon Ok

Given an undirected graph representing similarities between a set of items and an additive measure evaluating the items, we treat the position of a special subset of items in an ordinal ranking through a collection of combinatorial…

Data Structures and Algorithms · Computer Science 2026-05-05 Samuel Boardman

By adapting the iterative yardstick construction of Stockmeyer, we show that the reachability problem for vector addition systems with a stack does not have elementary complexity. As a corollary, the same lower bound holds for the…

Formal Languages and Automata Theory · Computer Science 2013-10-08 Ranko Lazic

A full solution to the recently proposed problem of determining the probability that no $k$-gon can be built from $n$ independently and uniformly chosen sticks in $[0,1]$ is proposed. This extends the known results for triangles and…

Combinatorics · Mathematics 2025-08-12 Julian Kern

Given two points in the plane, and a set of "obstacles" given as curves through the plane with assigned weights, we consider the point-separation problem, which asks for the minimum-weight subset of the obstacles separating the two points.…

Computational Geometry · Computer Science 2025-07-15 Jack Spalding-Jamieson , Anurag Murty Naredla

The mesoscopic concept is applied to the description of microcracked brittle materials. The mesoscopic equations are solved in a special case when the microcracks are developing according to the Rice-Griffith evolution law. The evolution of…

Materials Science · Physics 2015-06-24 P. Van , C. Papenfuss , W. Muschik

We consider two-stage robust optimization problems, which can be seen as games between a decision maker and an adversary. After the decision maker fixes part of the solution, the adversary chooses a scenario from a specified uncertainty…

Optimization and Control · Mathematics 2022-01-03 Marc Goerigk , Stefan Lendl , Lasse Wulf

The split common fixed point problems has found its applications in various branches of mathematics both pure and applied. It provides us a unified structure to study a large number of nonlinear mappings. Our interest here is to apply these…

Functional Analysis · Mathematics 2017-04-18 A. Kilicman , L. B. Mohammed

We contemplate a higher-level bipolar abstract argumentation for non-elementary arguments such as: X argues against Ys sincerity with the fact that Y has presented his argument to draw a conclusion C, by omitting other facts which would not…

Artificial Intelligence · Computer Science 2019-01-21 Ryuta Arisaka , Stefano Bistarelli , Francesco Santini

A proof is given of the global existence and uniqueness of a weak solution to Navier-Stokes boundary problem. The proof is short and essentially self-contained.

Analysis of PDEs · Mathematics 2015-05-19 Alexander G. Ramm

We obtain optimal lower and upper bounds for the (additive) integrality gaps of integer knapsack problems. In a randomised setting, we show that the integrality gap of a "typical" knapsack problem is drastically smaller than the integrality…

Optimization and Control · Mathematics 2016-11-14 Iskander Aliev , Martin Henk , Timm Oertel

In the Colored Bin Packing problem a set of items with varying weights and colors must be packed into bins of uniform weight limit such that no two items of the same color may be packed adjacently within a bin. We solve this problem for the…

Data Structures and Algorithms · Computer Science 2015-11-17 Hamza Alsarhan , Davin Chia , Ananya Christman , Shannia Fu , Yanfeng Jin

Electrical analogues of fracture, such as the fuse network model, are widely studied. However, the "analogy" between the electrical problem and the elastic problem is rarely established explicitly. Further, the fuse network is a discrete…

Materials Science · Physics 2016-01-25 Raghu Singh Rathore

We suggest a method of solving the problem of existence of a triangle with prescribed two bisectors and one third element which can be taken as one of the angles, the sides, the heights or the medians, or the third bisector.

History and Overview · Mathematics 2019-10-07 S. F. Osinkin

As we go along with a bioinformatic analysis we stumbled over a new combinatorial question. Although the problem is a very special one, there are maybe more applications than only this one we have. This text is mainly about the general…

Combinatorics · Mathematics 2014-11-18 Alexander Platzer

We give a compactness result for Brezis-Merle Problem with holderian condition. We look to the case of one or two blow-up points.

Analysis of PDEs · Mathematics 2018-09-07 Samy Skander Bahoura

Hub Covering Problems arise in various practical domains, such as urban planning, cargo delivery systems, airline networks, telecommunication network design, and e-mobility. The task is to select a set of hubs that enable tours between…

Discrete Mathematics · Computer Science 2025-03-05 Niklas Jost