arXiv subjects

Avi Steiner

Publications and source records attributed to Avi Steiner.

11 recordsLinked to original sources

arXiv2024

A new formulation of regular singularity

We provide an alternative definition for the familiar concept of regular singularity for meromorphic connections. Our new formulation does not use derived categories, and it also avoids the necessity of finding a special good filtration as in the formulation due to Kashiwara--Kawai. Moreover, our formulation provides an explicit algorithm to decide the regular singularity of a meromorphic connection. An important intermediary result, interesting in its own right, is that taking associated graded modules with respect to (not necessarily canonical) $V$-filtrations commutes with non-characteristic restriction. This allows us to reduce the proof of the equivalence of our formulation with the classical concept to the one-dimensional case. In that situation, we extend the well-known one-dimensional Fuchs criterion for ideals in the Weyl algebra to arbitrary holonomic modules over the Weyl algebra equipped with an arbitrary $(-1,1)$-filtration.

math.AG↗

arXiv2023

Quatroids and Rational Plane Cubics

It is a classical result that there are $12$ (irreducible) rational cubic curves through $8$ generic points in $\mathbb{P}_{\mathbb{C}}^2$, but little is known about the non-generic cases. The space of $8$-point configurations is partitioned into strata depending on combinatorial objects we call quatroids, a higher-order version of representable matroids. We compute all $779777$ quatroids on eight distinct points in the plane, which produces a full description of the stratification. For each stratum, we generate several invariants, including the number of rational cubics through a generic configuration. As a byproduct of our investigation, we obtain a collection of results regarding the base loci of pencils of cubics and positive certificates for non-rationality.

math.AG↗

arXiv2022

Tautological systems, homogeneous spaces and the holonomic rank problem

Many hypergeometric differential systems that arise from a geometric setting can be endowed with the structure of mixed Hodge modules. We generalize this fundamental result to the tautological systems associated to homogeneous spaces by giving a functorial construction for them. As an application, we solve the holonomic rank problem for such tautological systems in full generality.

math.AG↗

arXiv2022

Geometry of logarithmic derivations of hyperplane arrangements

We study the Hadamard product of the linear forms defining a hyperplane arrangement with those of its dual, which we view as generating an ideal in a certain polynomial ring. We use this ideal, which we call the ideal of pairs, to study logarithmic derivations and critical set varieties of arrangements in a way which is symmetric with respect to matroid duality. Our main result exhibits the variety of the ideal of pairs as a subspace arrangement whose components correspond to cyclic flats of the arrangement. As a corollary, we are able to give geometric explanations of some freeness and projective dimension results due to Ziegler and Kung--Schenck.

math.CO↗

arXiv2021

The Broadcast Approach in Communication Networks

This paper reviews the theoretical and practical principles of the broadcast approach to communication over state-dependent channels and networks in which the transmitters have access to only the probabilistic description of the time-varying states while remaining oblivious to their instantaneous realizations. When the temporal variations are frequent enough, an effective long-term strategy is adapting the transmission strategies to the system's ergodic behavior. However, when the variations are infrequent, their temporal average can deviate significantly from the channel's ergodic mode, rendering a lack of instantaneous performance guarantees. To circumvent a lack of short-term guarantees, the {\em broadcast approach} provides principles for designing transmission schemes that benefit from both short- and long-term performance guarantees. This paper provides an overview of how to apply the broadcast approach to various channels and network models under various operational constraints.

cs.IT↗

arXiv2020

Broadcast Approach for the Information Bottleneck Channel

This work considers a layered coding approach for efficient transmission of data over a wireless block fading channel without transmitter channel state information (CSI), which is connected to a limited capacity reliable link, known as the bottleneck channel. Two main approaches are considered, the first is an oblivious approach, where the sampled noisy observations are compressed and transmitted over the bottleneck channel without having any knowledge of the original information codebook. The second approach is a non-oblivious decode-forward (DF) relay where the sampled noisy data is decoded, and whatever is successfully decoded is reliably transmitted over the bottleneck channel. The bottleneck channel from relay to destination has a fixed capacity C. We examine also the case where the channel capacity can dynamically change due to variable loads on the backhaul link. The broadcast approach is analyzed for cases that only the relay knows the available capacity for next block, and for the case that neither source nor relay know the capacity per block, only its capacity distribution. Fortunately, it is possible to analytically describe in closed form expressions, the optimal continuous layering power distribution which maximizes the average achievable rate. Numerical results demonstrate the achievable broadcasting rates.

cs.IT↗

arXiv2019

Dualizing, projecting, and restricting GKZ systems

Let $A$ be an integer matrix, and assume that its semigroup ring $\mathbb{C}[\mathbb{N}A]$ is normal. Fix a face $F$ of the cone of $A$. We show that the projection and restriction of an $A$-hypergeometric system to the coordinate subspace corresponding to $F$ are essentially $F$-hypergeometric; moreover, at most one of them is nonzero. We also show that, if $A$ is in addition homogeneous, the holonomic dual of an $A$-hypergeometric system is itself $A$-hypergeometric. This extends a result of Uli Walther, proving a conjecture of Nobuki Takayama in the normal homogeneous case.

math.AG↗

arXiv2018

$A$-Hypergeometric Modules and Gauss--Manin Systems

Let $A$ be a $d$ by $n$ integer matrix. Gel'fand et al. proved that most $A$-hypergeometric systems have an interpretation as a Fourier--Laplace transform of a direct image. The set of parameters for which this happens was later identified by Schulze and Walther as the set of not strongly resonant parameters of $A$. A similar statement relating $A$-hypergeometric systems to exceptional direct images was proved by Reichelt. In this article, we consider a hybrid approach involving neighborhoods $U$ of the torus of $A$ and consider compositions of direct and exceptional direct images. Our main results characterize for which parameters the associated $A$-hypergeometric system is the inverse Fourier-Laplace transform of such a "mixed Gauss-Manin" system. In order to describe which $U$ work for such a parameter, we introduce the notions of fiber support and cofiber support of a D-module. If the semigroup ring of $A$ is normal, we show that every $A$-hypergeometric system is "mixed Gauss--Manin". We also give an explicit description of the neighborhoods $U$ which work for each parameter in terms of primitive integral support functions.

math.AG↗

arXiv2010

Broadcast Approach and Oblivious Cooperative Strategies for the Wireless Relay Channel - Part I: Sequential Decode-and-Forward (SDF)

In this two part paper we consider a wireless network in which a source terminal communicates with a destination and a relay terminal is occasionally present in close proximity to the source without source's knowledge, suggesting oblivious protocols. The source-relay channel is assumed to be a fixed gain AWGN due to the proximity while the source-destination and the relay-destination channels are subject to a block flat Rayleigh fading. A perfect CSI at the respective receivers only is assumed. With the average throughput as a performance measure, we incorporate a two-layer broadcast approach into two cooperative strategies based on the decode-and-forward scheme - Sequential Decoded-and Forward (SDF) in part I and the Block-Markov (BM) in part II. The broadcast approach splits the transmitted rate into superimposed layers corresponding to a "bad" and a "good" channel states, allowing better adaptation to the actual channel conditions In part I, the achievable rate expressions for the SDF strategy are derived under the broadcast approach for multiple settings including single user, MISO and the general relay setting using successive decoding technique, both numerically and analytically. Continuous broadcasting lower bounds are derived for the MISO and an oblivious cooperation scenarios.

cs.IT↗

arXiv2010

Broadcast Approach and Oblivious Cooperative Strategies for the Wireless Relay Channel - Part II: Block-Markov Decode-and-Forward (BMDF)

This is the second in a two part series of papers on incorporation of the broadcast approach into oblivious protocols for the relay channel where the source and the relay are collocated. Part I described the broadcast approach and its benefits in terms of achievable rates when used with the sequential decode- and-forward (SDF) scheme. Part II investigates yet another oblivious scheme, the Block-Markov decode- and-forward (BMDF) under the single and two-layered transmissions. For the single layer, previously reported results are enhanced and a conjecture regarding the optimal correlation coefficient between the source and the relay's transmission is established. For the discrete multi-layer transmission of two or more layers, it is shown that perfect cooperation (2x1 MISO) rates are attained even with low collocation gains at the expense of a longer delay, improving upon those achievable by the SDF.

cs.IT↗

arXiv2006

Broadcast Cooperation Strategies for Two Colocated Users

This work considers the problem of communication from a single transmitter, over a network with colocated users, through an independent block Rayleigh fading channel. The colocation nature of the users allows cooperation, which increases the overall achievable rate, from the transmitter to the destined user. The transmitter is ignorant of the fading coefficients, while receivers have access to perfect channel state information (CSI). This gives rise to the multi-layer broadcast approach used by the transmitter. The broadcast approach allows, in our network setting, to improve the cooperation between the colocated users. That is due to the nature of broadcasting, where the better the channel quality, the more layers that can be decoded. The cooperation between the users is performed over an additive white Gaussian channels (AWGN), with a relaying power constraint, and unlimited bandwidth. Three commonly used cooperation techniques are studied: amplify-forward (AF), compress-forward (CF), and decode-forward (DF). These methods are extended using the broadcast approach, for the case of relaxed decoding delay constraint. For this case a separated processing of the layers, which includes multi-session cooperation is shown to be beneficial. Further, closed form expressions for infinitely many AF sessions and recursive expressions for the more complex CF are given. Numerical results for the various cooperation strategies demonstrate the efficiency of multi-session cooperation.

cs.IT↗