A note on parity constrained orientations

This note extends a result of Frank, Jordán, and Szigeti [3] on parity constrained orientations with connectivity requirements. Given a hypergraph H, a non-negative intersecting supermodular set function p, and a preferred in-degree parity for every node, a formula is given on the minimum number of nodes with wrong in-degree parity in an orientation of H covering p.     

Parity and disparity subgraphs

A parity subgraph of a graph is a spanning subgraph such that the degrees of each vertex have the same parity in both the subgraph and the original graph. Known results include that every graph has an odd number of minimal parity subgraphs. Define a disparity subgraph to be a spanning subgraph such that each vertex has degrees of opposite parities in the subgraph and the original graph. (Only graphs with all even-order components can have disparity subgraphs). Every even-order spanning tree contains both a unique parity subgraph and a unique disparity subgraph. Moreover, every minimal disparity subgraph is shown to be paired by sharing a spanning tree with an odd number of minimal parity subgraphs, and every minimal parity subgraph is similarly paired with either one or an even number of minimal disparity subgraphs.     

Parity-alternating permutations and successions

The study of parity-alternating permutations of {1, 2, … n} is extended to permutations containing a prescribed number of parity successions — adjacent pairs of elements of the same parity. Several enumeration formulae are computed for permutations containing a given number of parity successions, in conjunction with further parity and length restrictions. The objects are classified using direct construction and elementary combinatorial techniques. Analogous results are derived for circular permutations.     

Cluster parity indices of partitions

Andrews recently made an extensive study of parity in partition identities. One of the open questions he listed was to describe the partitions enumerated by a series. The series resembled the series side of the Andrews–Gordon Identities with an extra parameter, and it seemed to have properties related to the parity indices, which are defined by Andrews. We define cluster parity indices, and settle the problem.     

On Parity Vectors of Latin Squares

The parity vectors of two Latin squares of the same side n provide a necessary condition for the two squares to be biembeddable in an orientable surface. We investigate constraints on the parity vector of a Latin square resulting from structural properties of the square, and show how the parity vector of a direct product may be obtained from the parity vectors of the constituent factors. Parity vectors for Cayley tables of all Abelian groups, some non-Abelian groups, Steiner quasigroups and Steiner loops are determined. Finally, we give a lower bound on the number of main classes of Latin squares of side n that admit no self-embeddings.     

Solving the linear matroid parity problem as a sequence of matroid intersection problems

In this paper, we present an O(r ⁴ n) algorithm for the linear matroid parity problem. Our solution technique is to introduce a modest generalization, the non-simple parity problem, and identify an important subclass of non-simple parity problems called easy parity problems which can be solved as matroid intersection problems. We then show how to solve any linear matroid parity problem parametrically as a sequence of easy parity problems.In contrast to other algorithmic work on this problem, we focus on general structural properties of dual solutions rather than on local primal structures. In a companion paper, we develop these ideas into a duality theory for the parity problem.     

Plane Graphs with Parity Constraints

Let S be a set of n points in general position in the plane. Together with S we are given a set of parity constraints, that is, every point of S is labeled either even or odd. A graph G on S satisfies the parity constraint of a point ${p\in S}$ if the parity of the degree of p in G matches its label. In this paper, we study how well various classes of planar graphs can satisfy arbitrary parity constraints. Specifically, we show that we can always find a plane tree, a two-connected outerplanar graph, or a pointed pseudo-triangulation that satisfy all but at most three parity constraints. For triangulations we can satisfy about 2/3 of the parity constraints and we show that in the worst case there is a linear number of constraints that cannot be fulfilled. In addition, we prove that for a given simple polygon H with polygonal holes on S, it is NP-complete to decide whether there exists a triangulation of H that satisfies all parity constraints.     

Monomorphism categories associated with symmetric groups and parity in finite groups

Monomorphism categories of the symmetric and alternating groups are studied via Cayley’s Em-bedding Theorem. It is shown that the parity is well defined in such categories. As an application, the parity in a finite group G is classified. It is proved that any element in a group of odd order is always even and such a group can be embedded into some alternating group instead of some symmetric group in the Cayley’s theorem. It is also proved that the parity in an abelian group of even order is always balanced and the parity in an nonabelian group is independent of its order.     

Perfect and locally perfect colorings

We present a new algorithm for coloring perfect graphs and use it to color the parity orderable graphs, a class which strictly contains parity graphs. Also, we modify this algorithm to obtain an O(m² + n) locally perfect coloring algorithm for parity graphs. © 1995 John Wiley & Sons, Inc.     

2-Adic valuations of certain ratios of products of factorials and applications

We prove the conjecture of Falikman-Friedland-Loewy on the parity of the degrees of projective varieties of n×n complex symmetric matrices of rank at most k. We also characterize the parity of the degrees of projective varieties of n×n complex skew symmetric matrices of rank at most 2p. We give recursive relations which determine the parity of the degrees of projective varieties of m×n complex matrices of rank at most k. In the case the degrees of these varieties are odd, we characterize the minimal dimensions of subspaces of n×n skew symmetric real matrices and of m×n real matrices containing a nonzero matrix of rank at most k. The parity questions studied here are also of combinatorial interest since they concern the parity of the number of plane partitions contained in a given box, on the one hand, and the parity of the number of symplectic tableaux of rectangular shape, on the other hand.     

Parity Splits by Triple Point Distances in X-Trees

At the conference Dress defined parity split maps by triple point distance and asked for a characterisation of such maps coming from binary phylogenetic X-trees. This article gives an answer to that question. The characterisation for X-trees can be easily described as follows: If all restrictions of a split map to sets of five or fewer elements is a parity split map for an X-tree, then so is the entire map. To ensure that the parity split map comes from an X-tree which is binary and phylogenetic, we add two more technical conditions also based on studying at most five points at a time. Received August 27, 2004     

Parity features for classes of the infinite symmetric group

A conjugacy class in the infinite-symmetric group is said to have parity features if no finitary odd permutation is a product of two of its members. The conjugacy classes having parity features are determined. The role played by a property of this kind in determining products of conjugacy classes in any group in which every element is conjugate with its inverse is studied.     

Covering systems with odd moduli

The concept of a covering system was first introduced by Erd?s in 1950. Since their introduction, a lot of the research regarding covering systems has focused on the existence of covering systems with certain restrictions on the moduli. Arguably, the most famous open question regarding covering systems is the odd covering problem. In this paper, we explore a variation of the odd covering problem, allowing a single odd prime to appear as a modulus in the covering more than once, while all other moduli are distinct, odd, and greater than 1. We also consider this variation while further requiring the moduli of the covering system to be square-free.     

基于T-S模糊模型的非线性不确定系统奇偶方程鲁棒故障诊断

针对T-S模糊模型描述的具有外部干扰的非线性不确定系统,构造了相应的测量冗余方程和奇偶方程,给出并证明了对特定传感器和执行器故障敏感的最优奇偶向量的存在条件和求解定理.采用奇偶方程故障检测与诊断方法,研究了非线性不确定系统的鲁棒故障检测和诊断.最后,通过仿真示例说明了本文所提出的方法是有效的.     

The parity problem of polymatroids without double circuits

According to the present state of the theory of the matroid parity problem, the existence of a good characterization to the size of a maximum matching depends on the behavior of certain substructures, called double circuits. In this paper we prove that if a polymatroid has no double circuits then a partition type min-max formula characterizes the size of a maximum matching. Applications to parity constrained orientations and to a rigidity problem are given. Research is supported by OTKA grants K60802, TS049788 and by European MCRTN Adonet, Contract Grant No. 504438.     

On the covering index of convex bodies

Covering a convex body by its homothets is a classical notion in discrete geometry that has resulted in a number of interesting and long-standing problems. Swanepoel introduced the covering parameter of a convex body as a means of quantifying its covering properties. In this paper, we introduce two relatives of the covering parameter called covering index and weak covering index, which upper bound well-studied quantities like the illumination number, the illumination parameter and the covering parameter of a convex body. Intuitively, the two indices measure how well a convex body can be covered by a relatively small number of homothets having the same relatively small homothety ratio. We show that the covering index is a lower semicontinuous functional on the Banach-Mazur space of convex bodies. We further show that the affine d-cubes minimize the covering index in any dimension d, while circular disks maximize it in the plane. Furthermore, the covering index satisfies a nice compatibility with the operations of direct vector sum and vector sum. In fact, we obtain an exact formula for the covering index of a direct vector sum of convex bodies that works in infinitely many instances. This together with a minimization property can be used to determine the covering index of infinitely many convex bodies. As the name suggests, the weak covering index loses some of the important properties of the covering index. Finally, we obtain upper bounds on the covering and weak covering index.     

The Largest Parity Demigenus of a Simple Graph

A graphΓisparity embeddedin a surface if a closed path in the graph is orientation preserving or reversing according as its length is even or odd. Theparity demigenusofΓis the minimum of 2−χ(S) (whereχis Euler characteristic) over all surfacesSin whichΓcan be parity embedded. We calculate the maximum parity demigenus over all loopless graphs of ordern. As a corollary we strengthen the calculation by Jungerman, Stahl, and White of the genus ofK_n,nbsp;nwith a perfect matching removed. We conclude by discussing numerous related problems.     

On linear combinations of special values of L-functions

Using a specific evaluation method for L-functions, it is shown that character values and weighted averages of Gauss sums can be well approximated by linear combinations of the algebraic parts of special values of L-functions under correct parity conditions. This is a surprising universal property of these special values since the coefficients of the resulting combinations turn out to be independent of the character but its parity.     

An exponential lower bound for Cunningham’s rule

In this paper we give an exponential lower bound for Cunningham’s least recently considered (round-robin) rule as applied to parity games, Markov decision processes and linear programs. This improves a recent subexponential bound of Friedmann for this rule on these problems. The round-robin rule fixes a cyclical order of the variables and chooses the next pivot variable starting from the previously chosen variable and proceeding in the given circular order. It is perhaps the simplest example from the class of history-based pivot rules. Our results are based on a new lower bound construction for parity games. Due to the nature of the construction we are also able to obtain an exponential lower bound for the round-robin rule applied to acyclic unique sink orientations of hypercubes (AUSOs). Furthermore these AUSOs are realizable as polytopes. We believe these are the first such results for history based rules for AUSOs, realizable or not. The paper is self-contained and requires no previous knowledge of parity games.     

Reduction about approximation spaces of covering generalized rough sets

The introduction of covering generalized rough sets has made a substantial contribution to the traditional theory of rough sets. The notion of attribute reduction can be regarded as one of the strongest and most significant results in rough sets. However, the efforts made on attribute reduction of covering generalized rough sets are far from sufficient. In this work, covering reduction is examined and discussed. We initially construct a new reduction theory by redefining the approximation spaces and the reducts of covering generalized rough sets. This theory is applicable to all types of covering generalized rough sets, and generalizes some existing reduction theories. Moreover, the currently insufficient reducts of covering generalized rough sets are improved by the new reduction. We then investigate in detail the procedures to get reducts of a covering. The reduction of a covering also provides a technique for data reduction in data mining.