Weight-Equitable Subdivision of Red and Blue Points in the Plane

2018 ◽  
Vol 28 (01) ◽  
pp. 39-56 ◽  
Author(s):  
Jude Buot ◽  
Mikio Kano
Keyword(s):  
General Position ◽  
Sufficient Conditions ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Total Weight ◽  
Blue Point ◽  
Disjoint Sets ◽  
Necessary And Sufficient ◽  
Positive Integers ◽  
Special Case

Let [Formula: see text] and [Formula: see text] be two disjoint sets of red points and blue points, respectively, in the plane in general position. Assign a weight [Formula: see text] to each red point and a weight [Formula: see text] to each blue point, where [Formula: see text] and [Formula: see text] are positive integers. Define the weight of a region in the plane as the sum of the weights of red and blue points in it. We give necessary and sufficient conditions for the existence of a line that bisects the weight of the plane whenever the total weight [Formula: see text] is [Formula: see text], for some integer [Formula: see text]. Moreover, we look closely into the special case where [Formula: see text] and [Formula: see text] since this case is important to generate a weight-equitable subdivision of the plane. Among other results, we show that for any configuration of [Formula: see text] with total weight [Formula: see text], for some integer [Formula: see text] and odd integer [Formula: see text], the plane can be subdivided into [Formula: see text] convex regions of weight [Formula: see text] if and only if [Formula: see text]. Using the proofs of the main result, we also give a polynomial time algorithm in finding a weight-equitable subdivision in the plane.

scholarly journals Characterizations and Identities for Isosceles Triangular Numbers

2021 ◽  
Vol 14 (2) ◽  
pp. 380-395
Author(s):  
Jiramate Punpim ◽  
Somphong Jitman
Keyword(s):  
Positive Integer ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Triangular Numbers ◽  
Triangular Number ◽  
Recursive Formulas ◽  
Necessary And Sufficient ◽  
Positive Integers ◽  
Special Case

Triangular numbers have been of interest and continuously studied due to their beautiful representations, nice properties, and various links with other figurate numbers. For positive integers n and l, the nth l-isosceles triangular number is a generalization of triangular numbers defined to be the arithmetic sum of the formT(n, l) = 1 + (1 + l) + (1 + 2l) + · · · + (1 + (n − 1)l).In this paper, we focus on characterizations and identities for isosceles triangular numbers as well as their links with other figurate numbers. Recursive formulas for constructions of isosceles triangular numbers are given together with necessary and sufficient conditions for a positive integer to be a sum of isosceles triangular  numbers. Various identities for isosceles triangular numbers are established. Results on triangular numbers can be viewed as a special case.

scholarly journals Independence of algebras with edge term

2015 ◽  
Vol 25 (07) ◽  
pp. 1145-1157 ◽  
Author(s):  
Erhard Aichinger ◽  
Peter Mayr
Keyword(s):  
Polynomial Time ◽  
Sufficient Conditions ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Universal Algebras ◽  
Finite Algebras ◽  
Necessary And Sufficient ◽  
Independent Varieties ◽  
Subdirect Factorization ◽  
Independence Of Algebras

In [A. L. Foster, The identities of — and unique subdirect factorization within — classes of universal algebras, Math. Z. 62 (1955) 171–188], two varieties [Formula: see text] of the same type are defined to be independent if there is a binary term [Formula: see text] such that [Formula: see text] and [Formula: see text]. In this paper, we give necessary and sufficient conditions for two finite algebras with a Mal’cev term (or, more generally, with an edge term) to generate independent varieties. In particular we show that the independence of finitely generated varieties with edge term can be decided by a polynomial time algorithm.

BICYCLIC SUBSEMIGROUPS IN AMALGAMS OF FINITE INVERSE SEMIGROUPS

2010 ◽  
Vol 20 (01) ◽  
pp. 89-113 ◽  
Author(s):  
EMANUELE RODARO
Keyword(s):  
Inverse Semigroup ◽  
Free Product ◽  
Sufficient Conditions ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Inverse Semigroups ◽  
Amalgamated Free Product ◽  
Free Product With Amalgamation ◽  
Necessary And Sufficient ◽  
Completely Semisimple

It is well known that an inverse semigroup is completely semisimple if and only if it does not contain a copy of the bicyclic semigroup. We characterize the amalgams [S1, S2; U] of two finite inverse semigroups S1, S2whose free product with amalgamation is completely semisimple and we show that checking whether the amalgamated free product of finite inverse semigroups contains a bicyclic subsemigroup is decidable by means of a polynomial time algorithm with respect to max {|S1|,|S2|}. Moreover we consider amalgams of finite inverse semigroups respecting the [Formula: see text]-order proving that the free product with amalgamation is completely semisimple and we also provide necessary and sufficient conditions for the [Formula: see text]-classes to be finite.

Individual Testing of Independent Items in Optimal Group Testing

1988 ◽  
Vol 2 (1) ◽  
pp. 23-29 ◽  
Author(s):  
Y. C. Yao ◽  
F. K. Hwang
Keyword(s):  
Group Testing ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Necessary And Sufficient Condition ◽  
Expected Number ◽  
Testing Problem ◽  
The Individual ◽  
Testing Algorithm ◽  
Necessary And Sufficient ◽  
Special Case

We consider the group testing problem for a set of independent items I = [I1,… In] where Ii, has probability pi, of being defective and probability qi = 1 – pi of being good. The problem is to classify all items as good or defective with a minimum expected number of group tests where a group test is a test on a subset S of I with two possible outcomes: either S is pure (contains no defective) or S is contaminated (contains at least one defective, with no information provided about which or how many). No polynomial-time algorithm is known for the group testing problem even for the special case pi = p for all i. Hence, any method that reduces the size of the problem is very helpful. In this paper, we give such a method by providing a simple condition to screen items that should be tested (only) individually. This condition leads to a necessary and sufficient condition for the individual testing algorithm to be optimal, generalizing a result of Unger [1] for the special case of identical pi.

PBW deformations of quantum symmetric algebras and their group extensions

2016 ◽  
Vol 15 (03) ◽  
pp. 1650049 ◽  
Author(s):  
Piyush Shroff ◽  
Sarah Witherspoon
Keyword(s):  
Finite Group ◽  
Lie Algebra ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Group Extensions ◽  
Enveloping Algebra ◽  
Symmetric Algebras ◽  
Necessary And Sufficient ◽  
Special Case

We examine PBW deformations of finite group extensions of quantum symmetric algebras, in particular the quantum Drinfeld orbifold algebras defined by the first author. We give a homological interpretation, in terms of Gerstenhaber brackets, of the necessary and sufficient conditions on parameter functions to define a quantum Drinfeld orbifold algebra, thus clarifying the conditions. In case the acting group is trivial, we determine conditions under which such a PBW deformation is a generalized enveloping algebra of a color Lie algebra; our PBW deformations include these algebras as a special case.

Joins of paths and cycles of equal order with sigma chromatic number 2

2021 ◽  
pp. 2250006
Author(s):  
Agnes D. Garciano ◽  
Maria Czarina T. Lagura ◽  
Reginaldo M. Marcelo
Keyword(s):  
Chromatic Number ◽  
Connected Graph ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Odd Cycle ◽  
Necessary And Sufficient ◽  
Positive Integers ◽  
Simple Connected Graph

For a simple connected graph [Formula: see text] let [Formula: see text] be a coloring of [Formula: see text] where two adjacent vertices may be assigned the same color. Let [Formula: see text] be the sum of colors of neighbors of any vertex [Formula: see text] The coloring [Formula: see text] is a sigma coloring of [Formula: see text] if for any two adjacent vertices [Formula: see text] [Formula: see text] The least number of colors required in a sigma coloring of [Formula: see text] is the sigma chromatic number of [Formula: see text] and is denoted by [Formula: see text] A sigma coloring of a graph is a neighbor-distinguishing type of coloring and it is known that the sigma chromatic number of a graph is bounded above by its chromatic number. It is also known that for a path [Formula: see text] and a cycle [Formula: see text] where [Formula: see text] [Formula: see text] and [Formula: see text] if [Formula: see text] is even. Let [Formula: see text] the join of the graphs [Formula: see text], where [Formula: see text] or [Formula: see text] [Formula: see text] and [Formula: see text] is not an odd cycle for any [Formula: see text]. It has been shown that if [Formula: see text] for [Formula: see text] and [Formula: see text] then [Formula: see text]. In this study, we give necessary and sufficient conditions under which [Formula: see text] where [Formula: see text] is the join of copies of [Formula: see text] and/or [Formula: see text] for the same value of [Formula: see text]. Let [Formula: see text] and [Formula: see text] be positive integers with [Formula: see text] and [Formula: see text] In this paper, we show that [Formula: see text] if and only if [Formula: see text] or [Formula: see text] is odd, [Formula: see text] is even and [Formula: see text]; and [Formula: see text] if and only if [Formula: see text] is even and [Formula: see text] We also obtain necessary and sufficient conditions on [Formula: see text] and [Formula: see text], so that [Formula: see text] for [Formula: see text] where [Formula: see text] or [Formula: see text] other than the cases [Formula: see text] and [Formula: see text]

A model for interaction of a Poisson and a renewal process and its relation with queuing theory

1972 ◽  
Vol 9 (2) ◽  
pp. 451-456 ◽  
Author(s):  
Lennart Råde
Keyword(s):  
Poisson Process ◽  
Renewal Process ◽  
Queuing Theory ◽  
Random Number ◽  
Sufficient Conditions ◽  
Stieltjes Transform ◽  
Time Intervals ◽  
Response Process ◽  
Necessary And Sufficient ◽  
Special Case

This paper discusses the response process when a Poisson process interacts with a renewal process in such a way that one or more points of the Poisson process eliminate a random number of consecutive points of the renewal process. A queuing situation is devised such that the c.d.f. of the length of the busy period is the same as the c.d.f. of the length of time intervals of the renewal response process. The Laplace-Stieltjes transform is obtained and from this the expectation of the time intervals of the response process is derived. For a special case necessary and sufficient conditions for the response process to be a Poisson process are found.

On the Integral Extensions of Quadratic Forms Over Local Fields

1970 ◽  
Vol 22 (2) ◽  
pp. 297-307 ◽  
Author(s):  
Melvin Band
Keyword(s):  
Prime Ideal ◽  
Local Field ◽  
Quadratic Forms ◽  
Sufficient Conditions ◽  
Local Fields ◽  
Ring Of Integers ◽  
Finite Dimensional ◽  
Integral Analogue ◽  
Necessary And Sufficient ◽  
Special Case

Let F be a local field with ring of integers and unique prime ideal (p). Suppose that V a finite-dimensional regular quadratic space over F, W and W′ are two isometric subspaces of V (i.e. τ: W → W′ is an isometry from W to W′). By the well-known Witt's Theorem, τ can always be extended to an isometry σ ∈ O(V).The integral analogue of this theorem has been solved over non-dyadic local fields by James and Rosenzweig [2], over the 2-adic fields by Trojan [4], and partially over the dyadics by Hsia [1], all for the special case that W is a line. In this paper we give necessary and sufficient conditions that two arbitrary dimensional subspaces W and W′ are integrally equivalent over non-dyadic local fields.

scholarly journals On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem

2020 ◽  
Vol 92 (1) ◽  
pp. 107-132 ◽  
Author(s):  
Britta Schulze ◽  
Michael Stiglmayr ◽  
Luís Paquete ◽  
Carlos M. Fonseca ◽  
David Willems ◽  
...  
Keyword(s):  
Knapsack Problem ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Approximation Ratio ◽  
Experimental Results ◽  
Cardinality Constraint ◽  
Quadratic Knapsack Problem ◽  
Problem Instances ◽  
Quadratic Knapsack ◽  
Special Case

Abstract In this article, we introduce the rectangular knapsack problem as a special case of the quadratic knapsack problem consisting in the maximization of the product of two separate knapsack profits subject to a cardinality constraint. We propose a polynomial time algorithm for this problem that provides a constant approximation ratio of 4.5. Our experimental results on a large number of artificially generated problem instances show that the average ratio is far from theoretical guarantee. In addition, we suggest refined versions of this approximation algorithm with the same time complexity and approximation ratio that lead to even better experimental results.

scholarly journals Invariant Bipartite Random Graphs on Rd

2014 ◽  
Vol 51 (3) ◽  
pp. 769-779
Author(s):  
Fabio Lopes
Keyword(s):  
Point Processes ◽  
Random Number ◽  
Probability Distributions ◽  
Sufficient Conditions ◽  
Stable Marriage ◽  
Simple Point ◽  
Stable Marriage Problem ◽  
Blue Point ◽  
Translation Invariant ◽  
Positive Integers

Suppose that red and blue points occur in Rd according to two simple point processes with finite intensities λR and λB, respectively. Furthermore, let ν and μ be two probability distributions on the strictly positive integers with means ν̅ and μ̅, respectively. Assign independently a random number of stubs (half-edges) to each red (blue) point with law ν (μ). We are interested in translation-invariant schemes for matching stubs between points of different colors in order to obtain random bipartite graphs in which each point has a prescribed degree distribution with law ν or μ depending on its color. For a large class of point processes, we show that such translation-invariant schemes matching almost surely all stubs are possible if and only if λRν̅ = λBμ̅, including the case when ν̅ = μ̅ = ∞ so that both sides are infinite. Furthermore, we study a particular scheme based on the Gale-Shapley stable marriage problem. For this scheme, we give sufficient conditions on ν and μ for the presence and absence of infinite components. These results are two-color versions of those obtained by Deijfen, Holroyd and Häggström.

Sign in / Sign up

Export Citation Format

Share Document