English
Related papers

Related papers: Cones from maximum $h$-scattered linear sets and a…

200 papers

We show that the number of lines in an $m$--homogeneous supersolvable line arrangement is upper bounded by $3m-3$ and we classify the $m$--homogeneous supersolvable line arrangements with two modular points up-to lattice-isotopy. A lower…

Algebraic Geometry · Mathematics 2019-10-09 Takuro Abe , Alexandru Dimca

Though ubiquitous as first-principles models for conservative phenomena, Hamiltonian systems present numerous challenges for model reduction even in relatively simple, linear cases. Here, we present a method for the projection-based model…

Numerical Analysis · Mathematics 2024-07-12 Anthony Gruber , Irina Tezaur

Persistent homology is a popular and useful tool for analysing finite metric spaces, revealing features that can be used to distinguish sets of unlabeled points and as input into machine learning pipelines. The famous stability theorem of…

Computational Geometry · Computer Science 2024-05-10 Philip Smith , Vitaliy Kurlin

In this paper, we propose a class of linear codes and obtain their weight distribution. Some of these codes are almost optimal. Moreover, several classes of constant composition codes(CCCs) are constructed as subcodes of linear codes.

Information Theory · Computer Science 2017-06-28 Long Yu , Xiusheng Liu

We study $q$-ary codes with distance defined by a partial order of the coordinates of the codewords. Maximum Distance Separable (MDS) codes in the poset metric have been studied in a number of earlier works. We consider codes that are close…

Information Theory · Computer Science 2010-05-03 Alexander Barg , Punarbasu Purkayastha

We study sets defined as the intersection of a rank-1 constraint with different choices of linear side constraints. We identify different conditions on the linear side constraints, under which the convex hull of the rank-1 set is polyhedral…

Optimization and Control · Mathematics 2019-09-20 Santanu S. Dey , Burak Kocuk , Asteroide Santana

Highly connected and yet sparse graphs (such as expanders or graphs of high treewidth) are fundamental, widely applicable and extensively studied combinatorial objects. We initiate the study of such highly connected graphs that are, in…

Computational Geometry · Computer Science 2013-06-17 Prosenjit Bose , Vida Dujmovic , Pat Morin , Michiel Smid

A topological hyperplane is a subspace of R^n (or a homeomorph of it) that is topologically equivalent to an ordinary straight hyperplane. An arrangement of topological hyperplanes in R^n is a finite set H such that k topological…

Combinatorics · Mathematics 2010-01-24 David Forge , Thomas Zaslavsky

We study cyclic sieving phenomena (CSP) on combinatorial objects from an abstract point of view by considering a rational polyhedral cone determined by the linear equations that define such phenomena. Each lattice point in the cone…

Combinatorics · Mathematics 2019-04-15 Per Alexandersson , Nima Amini

In this article we prove in the main theorem that, there is a bijection between the isomorphism classes of a certain type of real hyperplane arrangements on the one hand, and the antipodal pairs of convex cones of an associated…

Combinatorics · Mathematics 2021-10-29 C P Anil Kumar

A configuration of lattice vectors is supernormal if it contains a Hilbert basis for every cone spanned by a subset. We study such configurations from various perspectives, including triangulations, integer programming and Groebner bases.…

Combinatorics · Mathematics 2007-05-23 Serkan Hosten , Diane Maclagan , Bernd Sturmfels

In this paper we consider a class of weighted-volume preserving curvature flows acting on hypersurfaces that are trapped within two parallel hyperplanes and satisfy an orthogonal boundary condition. In the author's thesis the stability of…

Differential Geometry · Mathematics 2014-04-15 David Hartley

This is the first in a series of articles devoted to providing a foundation for a theory of flocks of arbitrary cones in PG(3,q). The desire to have such a theory stems from a need to better understand the very significant and applicable…

Combinatorics · Mathematics 2009-11-03 William Cherowitzo

We provide a deterministic construction of hard instances for the maximum independent set problem (MIS). The constructed hard instances form an infinite graph sequence with increasing size, which possesses similar characteristics to sparse…

Data Structures and Algorithms · Computer Science 2019-11-11 Naoto Shiraishi , Jun Takahashi

The concept of linear set in projective spaces over finite fields was introduced by Lunardon in 1999 and it plays central roles in the study of blocking sets, semifields, rank-distance codes and etc. A linear set with the largest possible…

Combinatorics · Mathematics 2021-09-30 Giovanni Longobardi , Giuseppe Marino , Rocco Trombetti , Yue Zhou

Surprisingly enough, the ratio of elastic to inelastic cross sections of proton interactions increases with energy in the interval correspond- ing to ISR - LHC (i.e. from 10 GeV to 10 TeV). That leads to special features of their spatial…

High Energy Physics - Phenomenology · Physics 2017-12-29 I. M. Dremin , V. A. Nechitailo , S. N. White

In pattern-forming systems, localized patterns are states of intermediate complexity between fully extended ordered patterns and completely irregular patterns. They are formed by stationary fronts enclosing an ordered pattern inside an…

Pattern Formation and Solitons · Physics 2013-08-06 G. Kozyreff , S. J. Chapman

Stopping sets and stopping set distribution of a linear code play an important role in the performance analysis of iterative decoding for this linear code. Let $C$ be an $[n,k]$ linear code over $\f$ with parity-check matrix $H$, where the…

Information Theory · Computer Science 2013-04-30 Jun Zhang , Fang-Wei Fu , Daqing Wan

Segregation patterns of size-bidisperse particle mixtures in a fully-three-dimensional flow produced by alternately rotating a spherical tumbler about two perpendicular axes are studied over a range of particle sizes and volume ratios using…

Soft Condensed Matter · Physics 2019-07-03 Mengqi Yu , Paul B. Umbanhowar , Julio M. Ottino , Richard M. Lueptow

We consider scattering of a free quantum particle on a singular potential with rather arbitrary shape of the support of the potential. In the classical limit $\hbar=0$ this problem reduces to the well known problem of chaotic scattering.…

chao-dyn · Physics 2009-10-22 Alexander G. Ramm , Gennady P. Berman