Results 71 to 80 of about 22,632 (241)
Toric amplitudes and universal adjoints
Abstract A toric amplitude is a rational function associated with a simplicial polyhedral fan. The definition is inspired by scattering amplitudes in particle physics. We prove algebraic properties of such amplitudes and study the geometry of their zero loci. These hypersurfaces play the role of Warren's adjoint via a dual volume interpretation.
Simon Telen
wiley +1 more source
Secret sharing is an important building block in cryptography. All explicit secret sharing schemes which are known to have optimal complexity are multi-linear, thus are closely related to linear codes.
Csirmaz Laszlo
doaj +1 more source
On higher Jacobians, Laplace equations, and Lefschetz properties
Abstract Let A$A$ be a standard graded Artinian K$\mathbb {K}$‐algebra over a field of characteristic zero. We prove that the failure of strong Lefschetz property (SLP) for A$A$ is equivalent to the osculating defect of a certain rational variety.
Charles Almeida +2 more
wiley +1 more source
Elementary lift and single element coextension of a binary gammoid
It is known that every binary elementary lift of a binary matroid is a matroid obtained by applying the splitting operation on that matroid. An elementary lift of a binary gammoid need not be a binary gammoid.
Shital Dilip Solanki +2 more
doaj +1 more source
Canonical forms of oriented matroids
Abstract Positive geometries are semialgebraic sets equipped with a canonical differential form whose residues mirror the boundary structure of the geometry. Every full‐dimensional projective polytope is a positive geometry. Motivated by the canonical forms of polytopes, we construct a canonical form for any tope of an oriented matroid inside the Orlik–
Christopher Eur, Thomas Lam
wiley +1 more source
Interpolation, box splines, and lattice points in zonotopes [PDF]
Given a finite list of vectors $X \subseteq \mathbb{R}^d$, one can define the box spline $B_X$. Box splines are piecewise polynomial functions that are used in approximation theory. They are also interesting from a combinatorial point of view and many of
Matthias Lenz
doaj +1 more source
Improved algorithms and analysis for the laminar matroid secretary problem [PDF]
In a matroid secretary problem, one is presented with a sequence of objects of various weights in a random order, and must choose irrevocably to accept or reject each item.
Harris, David, Purohit, Manish
core
Abstract In 1935, Philip Hall published what is often referred to as ‘Hall's marriage theorem’ in a short paper (P. Hall, J. Lond. Math. Soc. (1) 10 (1935), no. 1, 26–30.) This paper has been very influential. I state the theorem and outline Hall's proof, together with some equivalent (or stronger) earlier results, and proceed to discuss some the many ...
Peter J. Cameron
wiley +1 more source
Covering-Based Rough Sets on Eulerian Matroids
Rough set theory is an efficient and essential tool for dealing with vagueness and granularity in information systems. Covering-based rough set theory is proposed as a significant generalization of classical rough sets.
Bin Yang, Ziqiong Lin, William Zhu
doaj +1 more source
On triangular matroids induced by n3-configurations
A triangular matroid is a rank-3 matroid whose ground set consists of the points of an n3{n}_{3}-configuration and whose bases are the point triples corresponding to non-triangles within the configuration.
Alazemi Abdullah, Raney Michael
doaj +1 more source

