Searcharxiv⌕ Search

arXiv subjects

Sergey Yuzvinsky

Publications and source records attributed to Sergey Yuzvinsky.

At least 19 recordsLinked to original sources
arXiv2017

Abelian duality and propagation of resonance

We explore the relationship between a certain "abelian duality" property of spaces and the propagation properties of their cohomology jump loci. To that end, we develop the analogy between abelian duality spaces and those spaces which possess what we call the "EPY property." The same underlying homological algebra allows us to deduce the propagation of jump loci: in the former case, characteristic varieties propagate, and in the latter, the resonance varieties. We apply the general theory to arrangements of linear and elliptic hyperplanes, as well as toric complexes, right-angled Artin groups, and Bestvina-Brady groups. Our approach brings to the fore the relevance of the Cohen-Macaulay condition in this combinatorial context.

math.AT↗
arXiv2015

Combinatorial covers and vanishing of cohomology

We use a Mayer-Vietoris-like spectral sequence to establish vanishing results for the cohomology of complements of linear and elliptic hyperplane arrangements, as part of a more general framework involving duality and abelian duality properties of spaces and groups. In the process, we consider cohomology of local systems with a general, Cohen-Macaulay-type condition. As a result, we recover known vanishing theorems for rank-1 local systems as well as group ring coefficients, and obtain new generalizations.

math.AT↗
arXiv2015

The higher topological complexity of subcomplexes of products of spheres---and related polyhedral product spaces

We construct "higher" motion planners for automated systems whose space of states are homotopy equivalent to a polyhedral product space $Z(K,\{(S^{k_i},\star)\})$, e.g. robot arms with restrictions on the possible combinations of simultaneously moving nodes. Our construction is shown to be optimal by explicit cohomology calculations. The higher topological complexity of other families of polyhedral product spaces is also determined.

math.AT↗
arXiv2014

Higher topological complexity of Artin type groups

We calculate the higher topological complexity TC$_s$ for the complements of reflection arrangements, in other words for the pure Artin type groups of all finite complex reflection groups. In order to do that we introduce a simple combinatorial criterion of arrangements sufficed for the cohomological low bound for TC$_s$ to coincide with the dimensional upper bound.

math.AT↗
arXiv2013

Multinets in $\mathbb P^2$

Multinets are certain configurations of lines and points with multiplicities in the complex projective plane P2. They are used in the studies of resonance and characteristic varieties of complex hyperplane arrangement complements and cohomology of Milnor fibers. From combinatorics viewpoint they can be considered as generalizations of Latin squares. Very few exam- ples of multinets with non-trivial multiplicities are known. In this paper, we present new examples of multinets. These are obtained by using an analogue of nets in P3 and intersecting them by planes.

math.AG↗
arXiv2011

On the local zeta functions and the b-functions of certain hyperplane arrangements

Conjectures of J. Igusa for p-adic local zeta functions and of J. Denef and F. Loeser for topological local zeta functions assert that (the real part of) the poles of these local zeta functions are roots of the Bernstein-Sato polynomials (i.e. the b-functions). We prove these conjectures for certain hyperplane arrangements, including the case of reduced hyperplane arrangements in three-dimensional affine space.

math.AG↗
arXiv2006

Multinets, resonance varieties, and pencils of plane curves

We show that a line arrangement in the complex projective plane supports a nontrivial resonance variety if and only if it is the underlying arrangement of a "multinet," a multi-arrangement with a partition into three or more equinumerous classes which have equal multiplicities at each inter-class intersection point, and satisfy a connectivity condition. We also prove that this combinatorial structure is equivalent to the existence of a pencil of plane curves, also satisfying a connectivity condition, whose singular fibers include at least three products of lines, which comprise the arrangement. We derive numerical conditions which impose restrictions on the number of classes, and the line and point multiplicities that can appear in multinets, and allow us to detect whether the associated pencils yield nonlinear fiberings of the complement.

math.AG↗
arXiv2006

Topological complexity of collision free motion planning algorithms in the presence of multiple moving obstacles

We study motion planning algorithms for collision free control of multiple objects in the presence of moving obstacles. We compute the topological complexity of algorithms solving this problem. We apply topological tools and use information about cohomology algebras of configuration spaces. The results of the paper may potentially be used in systems of automatic traffic control.

math.OC↗
arXiv2005

Derivations of an effective divisor on the complex projective line

In this paper we consider an effective divisor on the complex projective line and associate with it the module D consisting of all the derivations $θ$ such that $θ(I_i)\subset I_i^{m_i}$ for every $i$, where $I_i$ is the ideal of $p_i$. The module D is graded and free of rank 2; the degrees of its homogeneous basis, called the exponents, form an important invariant of the divisor. We prove that under certain conditions on $(m_i)$ the exponents do not depend on $\{p_i\}$. Our main result asserts that if these conditions do not hold for $(m_i)$ then there exists a general position of $n$ points for which the exponents do not change. We give an explicit formula for them. We also exhibit some examples of degeneration of the exponents, in particular those where the degeneration is defined by vanishing of certain Shur functions. As application and motivation, we show that our results imply Terao's conjecture (about the combinatorial nature of the freeness of hyperplane arrangements) for certain new classes of arrangements of lines in the complex projective plane.

math.AG↗
arXiv2003

Chow rings of toric varieties defined by atomic lattices

We study a graded algebra D=D(L,G) defined by a finite lattice L and a subset G in L, a so-called building set. This algebra is a generalization of the cohomology algebras of hyperplane arrangement compactifications found in work of De Concini and Procesi. Our main result is a representation of D, for an arbitrary atomic lattice L, as the Chow ring of a smooth toric variety that we construct from L and G. We describe this variety both by its fan and geometrically by a series of blowups and orbit removal. Also we find a Groebner basis of the relation ideal of D and a monomial basis of D over Z.

math.AG↗
arXiv2003

Realization of finite Abelian groups by nets in P^2

In the paper, we study special configurations of lines and points in the complex projective plane, so called k-nets. We describe the role of these configurations in studies of cohomology on arrangement complements. Our most general result is the restriction on k - it can be only 3,4, or 5. The most interesting class of nets is formed by 3-nets that relate to finite geometries, latin squares, loops, etc. All known examples of 3-nets in P^2 realize finite Abelian groups. We study the problem what groups can be so realized. Our main result is that, except for groups with all invariant factors under 10, realizable groups are isomorphic to subgroups of a 2-torus. This follows from the `algebraization' result asserting that in the dual plane, the points dual to lines of a net lie on a plane cubic.

math.CO↗
arXiv2002

Topological Robotics: Subspace Arrangements and Collision Free Motion Planning

We study an elementary problem of the topological robotics: collective motion of a set of $n$ distinct particles which one has to move from an initial configuration to a final configuration, with the requirement that no collisions occur in the process of motion. The ultimate goal is to construct an algorithm which will perform this task once the initial and the final configurations are given. This reduces to a topological problem of finding the topological complexity TC(C_n(\R^m)) of the configutation space C_n(\R^m) of $n$ distinct ordered particles in \R^m. We solve this problem for m=2 (the planar case) and for all odd m, including the case m=3 (particles in the three-dimensional space). We also study a more general motion planning problem in Euclidean space with a hyperplane arrangement as obstacle.

math.AT↗
arXiv2002

Topological robotics: motion planning in projective spaces

We study an elementary problem of topological robotics: rotation of a line, which is fixed by a revolving joint at a base point: one wants to bring the line from its initial position to a final position by a continuous motion in the space. The final goal is to construct an algorithm which will perform this task once the initial and final positions are given. Any such motion planning algorithm will have instabilities, which are caused by topological reasons. A general approach to study instabilities of robot motion was suggested recently by the first named author. With any path-connected topological space X one associates a number TC(X), called the topological complexity of X. This number is of fundamental importance for the motion planning problem: TC(X) determines character of instabilities which have all motion planning algorithms in X. In the present paper we study the topological complexity of real projective spaces. In particular we compute TC(RP^n) for all n<24. Our main result is that (for n distinct from 1, 3, 7) the problem of calculating of TC(RP^n) is equivalent to finding the smallest k such that RP^n can be immersed into the Euclidean space R^{k-1}.

math.AT↗
arXiv2001

Hyperplane Arrangement Cohomology and Monomials in the Exterior Algebra

We show that if X is the complement of a complex hyperplane arrangement, then the homology of X has linear free resolution as a module over the exterior algebra on the first cohomology of X. We study invariants of X that can be deduced from this resolution. A key ingredient is a result of Aramova, Avramov, and Herzog [2000] on resolutions of monomial ideals in the exterior algebra. We give a new conceptual proof of this result.

math.AG↗
arXiv2000

Annihilators of Ideals of Exterior Algebras

The Orlik-Solomon algebra A of a matroid is isomorphic to the quotient of an exterior algebra E by a defining ideal I. We find an explicit presentation of the annihilator ideal of I or, equivalently, the E-module dual to A. As an application of that we provide a necessary, combinatorial condition for the algebra A to be quadratic. We show that this is stronger than matroid being line-closed thereby resolving (negatively) a conjecture by Falk. We also show that our condition is not sufficient for the quadraticity.

math.CO↗
arXiv1999

Taylor and minimal resolutions of homogeneous polynomial ideals

We give a necessary and sufficient condition on a homogeneous polynomial ideal for its Taylor complex to be exact. Then we give a combinatorial construction of a minimal resolution for ideals satisfying the above condition (in particular for monomial ideals).

math.AC↗